./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e05f886a34f8c66061ddfaaaf6f31f7046aa524559c342b84144c174891a52
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 06:16:35,504 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 06:16:35,539 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 06:16:35,543 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 06:16:35,543 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 06:16:35,556 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 06:16:35,557 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 06:16:35,557 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 06:16:35,558 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 06:16:35,558 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 06:16:35,558 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 06:16:35,559 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 06:16:35,559 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 06:16:35,559 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 06:16:35,559 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 06:16:35,560 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 06:16:35,560 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 06:16:35,560 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 06:16:35,560 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 06:16:35,560 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 06:16:35,561 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 06:16:35,561 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 06:16:35,561 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 06:16:35,562 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 06:16:35,562 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 06:16:35,562 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 06:16:35,562 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 06:16:35,562 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 06:16:35,563 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 06:16:35,563 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 06:16:35,563 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:16:35,563 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 06:16:35,563 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 06:16:35,564 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 06:16:35,564 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 06:16:35,564 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 06:16:35,564 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 06:16:35,564 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 06:16:35,564 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 06:16:35,564 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 06:16:35,565 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 06:16:35,565 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69e05f886a34f8c66061ddfaaaf6f31f7046aa524559c342b84144c174891a52
[2024-03-09 06:16:35,754 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 06:16:35,786 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 06:16:35,788 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 06:16:35,789 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 06:16:35,789 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 06:16:35,791 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-09 06:16:36,850 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 06:16:37,053 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 06:16:37,053 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-09 06:16:37,069 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/5ec6045ba/8f27befff83844328bc0bd948439d2d8/FLAG15f2434f3
[2024-03-09 06:16:37,430 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/5ec6045ba/8f27befff83844328bc0bd948439d2d8
[2024-03-09 06:16:37,432 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 06:16:37,433 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 06:16:37,434 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 06:16:37,434 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 06:16:37,438 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 06:16:37,439 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,439 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d45021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37, skipping insertion in model container
[2024-03-09 06:16:37,440 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,472 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 06:16:37,711 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:16:37,717 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 06:16:37,748 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:16:37,782 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 06:16:37,782 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37 WrapperNode
[2024-03-09 06:16:37,783 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 06:16:37,783 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 06:16:37,783 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 06:16:37,784 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 06:16:37,788 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,801 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,819 INFO  L138                Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76
[2024-03-09 06:16:37,819 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 06:16:37,820 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 06:16:37,820 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 06:16:37,820 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 06:16:37,827 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,827 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,830 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,830 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,836 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,838 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,839 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,840 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,842 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 06:16:37,843 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 06:16:37,843 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 06:16:37,843 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 06:16:37,844 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (1/1) ...
[2024-03-09 06:16:37,848 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:16:37,855 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:16:37,866 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-09 06:16:37,891 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-09 06:16:37,916 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 06:16:37,916 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 06:16:37,916 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 06:16:37,916 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 06:16:37,916 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 06:16:37,916 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-03-09 06:16:37,917 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 06:16:37,917 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 06:16:37,917 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 06:16:37,917 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 06:16:37,918 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 06:16:38,049 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 06:16:38,050 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 06:16:38,223 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 06:16:38,230 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 06:16:38,231 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 06:16:38,232 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:16:38 BoogieIcfgContainer
[2024-03-09 06:16:38,232 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 06:16:38,233 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 06:16:38,234 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 06:16:38,236 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 06:16:38,236 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:16:37" (1/3) ...
[2024-03-09 06:16:38,236 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8c51e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:16:38, skipping insertion in model container
[2024-03-09 06:16:38,236 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:37" (2/3) ...
[2024-03-09 06:16:38,237 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8c51e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:16:38, skipping insertion in model container
[2024-03-09 06:16:38,237 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:16:38" (3/3) ...
[2024-03-09 06:16:38,238 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2024-03-09 06:16:38,244 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 06:16:38,251 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 06:16:38,251 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-09 06:16:38,251 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 06:16:38,295 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 06:16:38,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 209 flow
[2024-03-09 06:16:38,364 INFO  L124   PetriNetUnfolderBase]: 6/144 cut-off events.
[2024-03-09 06:16:38,364 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 06:16:38,369 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 6/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-03-09 06:16:38,370 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 209 flow
[2024-03-09 06:16:38,377 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 209 flow
[2024-03-09 06:16:38,386 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:16:38,402 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6cd615ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:16:38,402 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-09 06:16:38,411 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:16:38,411 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-09 06:16:38,411 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:16:38,411 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:38,412 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:38,412 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:16:38,416 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:38,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 447786827, now seen corresponding path program 1 times
[2024-03-09 06:16:38,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:38,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085759429]
[2024-03-09 06:16:38,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:38,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:38,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:38,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:38,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:38,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085759429]
[2024-03-09 06:16:38,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085759429] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:38,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:38,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:38,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113740702]
[2024-03-09 06:16:38,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:38,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:16:38,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:38,710 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:16:38,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:16:38,831 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 101
[2024-03-09 06:16:38,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 209 flow. Second operand  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:38,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:38,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 101
[2024-03-09 06:16:38,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:38,883 INFO  L124   PetriNetUnfolderBase]: 1/145 cut-off events.
[2024-03-09 06:16:38,883 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 06:16:38,884 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 145 events. 1/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. 
[2024-03-09 06:16:38,885 INFO  L140   encePairwiseOnDemand]: 90/101 looper letters, 11 selfloop transitions, 2 changer transitions 6/103 dead transitions.
[2024-03-09 06:16:38,885 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 103 transitions, 249 flow
[2024-03-09 06:16:38,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:38,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:38,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions.
[2024-03-09 06:16:38,897 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8811881188118812
[2024-03-09 06:16:38,898 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 534 transitions.
[2024-03-09 06:16:38,898 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions.
[2024-03-09 06:16:38,900 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:38,902 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions.
[2024-03-09 06:16:38,906 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:38,910 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:38,911 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:38,912 INFO  L175             Difference]: Start difference. First operand has 100 places, 101 transitions, 209 flow. Second operand 6 states and 534 transitions.
[2024-03-09 06:16:38,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 103 transitions, 249 flow
[2024-03-09 06:16:38,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:38,918 INFO  L231             Difference]: Finished difference. Result has 109 places, 97 transitions, 219 flow
[2024-03-09 06:16:38,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=109, PETRI_TRANSITIONS=97}
[2024-03-09 06:16:38,922 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places.
[2024-03-09 06:16:38,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 219 flow
[2024-03-09 06:16:38,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:38,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:38,923 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:38,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 06:16:38,924 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:16:38,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:38,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103953729, now seen corresponding path program 1 times
[2024-03-09 06:16:38,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:38,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076133571]
[2024-03-09 06:16:38,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:38,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:38,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:39,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:39,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:39,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076133571]
[2024-03-09 06:16:39,231 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076133571] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:39,231 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:39,231 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:39,231 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083290054]
[2024-03-09 06:16:39,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:39,232 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:16:39,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:39,233 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:16:39,233 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:16:39,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 101
[2024-03-09 06:16:39,430 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 219 flow. Second operand  has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:39,430 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:39,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 101
[2024-03-09 06:16:39,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:39,629 INFO  L124   PetriNetUnfolderBase]: 90/425 cut-off events.
[2024-03-09 06:16:39,629 INFO  L125   PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES.
[2024-03-09 06:16:39,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 701 conditions, 425 events. 90/425 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2037 event pairs, 52 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 588. Up to 200 conditions per place. 
[2024-03-09 06:16:39,632 INFO  L140   encePairwiseOnDemand]: 90/101 looper letters, 31 selfloop transitions, 22 changer transitions 0/118 dead transitions.
[2024-03-09 06:16:39,632 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 118 transitions, 367 flow
[2024-03-09 06:16:39,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:39,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:39,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 450 transitions.
[2024-03-09 06:16:39,634 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7425742574257426
[2024-03-09 06:16:39,634 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 450 transitions.
[2024-03-09 06:16:39,634 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 450 transitions.
[2024-03-09 06:16:39,635 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:39,635 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 450 transitions.
[2024-03-09 06:16:39,636 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:39,638 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:39,638 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:39,638 INFO  L175             Difference]: Start difference. First operand has 109 places, 97 transitions, 219 flow. Second operand 6 states and 450 transitions.
[2024-03-09 06:16:39,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 118 transitions, 367 flow
[2024-03-09 06:16:39,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 353 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-09 06:16:39,642 INFO  L231             Difference]: Finished difference. Result has 110 places, 118 transitions, 355 flow
[2024-03-09 06:16:39,642 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=110, PETRI_TRANSITIONS=118}
[2024-03-09 06:16:39,643 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places.
[2024-03-09 06:16:39,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 118 transitions, 355 flow
[2024-03-09 06:16:39,644 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:39,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:39,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:39,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 06:16:39,644 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:16:39,645 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:39,645 INFO  L85        PathProgramCache]: Analyzing trace with hash 432467112, now seen corresponding path program 1 times
[2024-03-09 06:16:39,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:39,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403457369]
[2024-03-09 06:16:39,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:39,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:39,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:39,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:39,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:39,919 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403457369]
[2024-03-09 06:16:39,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403457369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:39,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:39,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:39,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783325177]
[2024-03-09 06:16:39,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:39,920 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:16:39,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:39,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:16:39,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:16:40,026 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 101
[2024-03-09 06:16:40,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 118 transitions, 355 flow. Second operand  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:40,027 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 101
[2024-03-09 06:16:40,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:40,290 INFO  L124   PetriNetUnfolderBase]: 197/671 cut-off events.
[2024-03-09 06:16:40,290 INFO  L125   PetriNetUnfolderBase]: For 159/189 co-relation queries the response was YES.
[2024-03-09 06:16:40,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 671 events. 197/671 cut-off events. For 159/189 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3663 event pairs, 36 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1329. Up to 341 conditions per place. 
[2024-03-09 06:16:40,295 INFO  L140   encePairwiseOnDemand]: 82/101 looper letters, 41 selfloop transitions, 64 changer transitions 7/177 dead transitions.
[2024-03-09 06:16:40,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 177 transitions, 753 flow
[2024-03-09 06:16:40,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:40,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:40,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions.
[2024-03-09 06:16:40,297 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8366336633663366
[2024-03-09 06:16:40,297 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 507 transitions.
[2024-03-09 06:16:40,298 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions.
[2024-03-09 06:16:40,298 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:40,298 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions.
[2024-03-09 06:16:40,299 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,300 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,301 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,301 INFO  L175             Difference]: Start difference. First operand has 110 places, 118 transitions, 355 flow. Second operand 6 states and 507 transitions.
[2024-03-09 06:16:40,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 177 transitions, 753 flow
[2024-03-09 06:16:40,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 177 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:40,306 INFO  L231             Difference]: Finished difference. Result has 120 places, 170 transitions, 833 flow
[2024-03-09 06:16:40,306 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=120, PETRI_TRANSITIONS=170}
[2024-03-09 06:16:40,307 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places.
[2024-03-09 06:16:40,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 170 transitions, 833 flow
[2024-03-09 06:16:40,307 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,308 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:40,308 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:40,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 06:16:40,308 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:16:40,308 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:40,309 INFO  L85        PathProgramCache]: Analyzing trace with hash -540253893, now seen corresponding path program 1 times
[2024-03-09 06:16:40,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:40,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958822851]
[2024-03-09 06:16:40,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:40,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:40,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:40,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:16:40,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:40,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958822851]
[2024-03-09 06:16:40,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958822851] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:40,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:40,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:40,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162000723]
[2024-03-09 06:16:40,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:40,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:16:40,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:40,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:16:40,539 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:16:40,749 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 101
[2024-03-09 06:16:40,750 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 170 transitions, 833 flow. Second operand  has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,750 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:40,750 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 101
[2024-03-09 06:16:40,750 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:40,891 INFO  L124   PetriNetUnfolderBase]: 208/743 cut-off events.
[2024-03-09 06:16:40,891 INFO  L125   PetriNetUnfolderBase]: For 608/671 co-relation queries the response was YES.
[2024-03-09 06:16:40,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 743 events. 208/743 cut-off events. For 608/671 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4456 event pairs, 15 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1971. Up to 271 conditions per place. 
[2024-03-09 06:16:40,896 INFO  L140   encePairwiseOnDemand]: 85/101 looper letters, 80 selfloop transitions, 36 changer transitions 0/200 dead transitions.
[2024-03-09 06:16:40,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 200 transitions, 1236 flow
[2024-03-09 06:16:40,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:40,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:40,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions.
[2024-03-09 06:16:40,898 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7788778877887789
[2024-03-09 06:16:40,898 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 472 transitions.
[2024-03-09 06:16:40,898 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions.
[2024-03-09 06:16:40,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:40,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions.
[2024-03-09 06:16:40,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,901 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,901 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,901 INFO  L175             Difference]: Start difference. First operand has 120 places, 170 transitions, 833 flow. Second operand 6 states and 472 transitions.
[2024-03-09 06:16:40,902 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 200 transitions, 1236 flow
[2024-03-09 06:16:40,909 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 200 transitions, 1218 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:40,912 INFO  L231             Difference]: Finished difference. Result has 122 places, 199 transitions, 1163 flow
[2024-03-09 06:16:40,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=122, PETRI_TRANSITIONS=199}
[2024-03-09 06:16:40,913 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places.
[2024-03-09 06:16:40,913 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 199 transitions, 1163 flow
[2024-03-09 06:16:40,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:40,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:40,914 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:40,914 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 06:16:40,914 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:16:40,914 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:40,914 INFO  L85        PathProgramCache]: Analyzing trace with hash -1499105620, now seen corresponding path program 1 times
[2024-03-09 06:16:40,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:40,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104389805]
[2024-03-09 06:16:40,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:40,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:40,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:16:40,946 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:16:40,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:16:40,976 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:16:40,976 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:16:40,977 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-09 06:16:40,978 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-09 06:16:40,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-09 06:16:40,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-09 06:16:40,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-09 06:16:40,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-09 06:16:40,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-09 06:16:40,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 06:16:40,980 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-09 06:16:40,982 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:16:40,982 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 06:16:41,000 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 06:16:41,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow
[2024-03-09 06:16:41,026 INFO  L124   PetriNetUnfolderBase]: 11/263 cut-off events.
[2024-03-09 06:16:41,026 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 06:16:41,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 11/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 493 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. 
[2024-03-09 06:16:41,026 INFO  L82        GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 254 flow
[2024-03-09 06:16:41,027 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 254 flow
[2024-03-09 06:16:41,028 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:16:41,029 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6cd615ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:16:41,029 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-09 06:16:41,032 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:16:41,032 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-09 06:16:41,032 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:16:41,033 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:41,033 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:41,033 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:41,033 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:41,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -1670539381, now seen corresponding path program 1 times
[2024-03-09 06:16:41,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:41,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288625522]
[2024-03-09 06:16:41,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:41,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:41,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:41,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:41,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:41,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288625522]
[2024-03-09 06:16:41,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288625522] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:41,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:41,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:41,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049911428]
[2024-03-09 06:16:41,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:41,084 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:16:41,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:41,084 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:16:41,084 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:16:41,172 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 119
[2024-03-09 06:16:41,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 254 flow. Second operand  has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,173 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:41,173 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 119
[2024-03-09 06:16:41,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:41,220 INFO  L124   PetriNetUnfolderBase]: 3/261 cut-off events.
[2024-03-09 06:16:41,221 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-03-09 06:16:41,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 261 events. 3/261 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 523 event pairs, 0 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 168. Up to 32 conditions per place. 
[2024-03-09 06:16:41,222 INFO  L140   encePairwiseOnDemand]: 108/119 looper letters, 14 selfloop transitions, 2 changer transitions 6/122 dead transitions.
[2024-03-09 06:16:41,222 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 302 flow
[2024-03-09 06:16:41,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:41,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:41,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions.
[2024-03-09 06:16:41,224 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8865546218487395
[2024-03-09 06:16:41,224 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 633 transitions.
[2024-03-09 06:16:41,224 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions.
[2024-03-09 06:16:41,224 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:41,224 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions.
[2024-03-09 06:16:41,226 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,227 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,227 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,227 INFO  L175             Difference]: Start difference. First operand has 119 places, 119 transitions, 254 flow. Second operand 6 states and 633 transitions.
[2024-03-09 06:16:41,227 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 302 flow
[2024-03-09 06:16:41,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 122 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:41,229 INFO  L231             Difference]: Finished difference. Result has 128 places, 116 transitions, 268 flow
[2024-03-09 06:16:41,229 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=128, PETRI_TRANSITIONS=116}
[2024-03-09 06:16:41,230 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places.
[2024-03-09 06:16:41,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 116 transitions, 268 flow
[2024-03-09 06:16:41,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:41,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:41,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 06:16:41,231 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:41,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:41,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -139649160, now seen corresponding path program 1 times
[2024-03-09 06:16:41,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:41,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222273269]
[2024-03-09 06:16:41,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:41,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:41,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:41,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:41,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:41,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222273269]
[2024-03-09 06:16:41,395 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222273269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:41,395 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:41,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:41,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423473356]
[2024-03-09 06:16:41,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:41,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:16:41,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:41,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:16:41,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:16:41,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 78 out of 119
[2024-03-09 06:16:41,594 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 116 transitions, 268 flow. Second operand  has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,594 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:41,594 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 119
[2024-03-09 06:16:41,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:41,945 INFO  L124   PetriNetUnfolderBase]: 1143/3263 cut-off events.
[2024-03-09 06:16:41,945 INFO  L125   PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES.
[2024-03-09 06:16:41,949 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 3263 events. 1143/3263 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 24951 event pairs, 764 based on Foata normal form. 0/2972 useless extension candidates. Maximal degree in co-relation 4312. Up to 1816 conditions per place. 
[2024-03-09 06:16:41,958 INFO  L140   encePairwiseOnDemand]: 104/119 looper letters, 38 selfloop transitions, 38 changer transitions 0/153 dead transitions.
[2024-03-09 06:16:41,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 494 flow
[2024-03-09 06:16:41,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:41,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:41,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions.
[2024-03-09 06:16:41,961 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7619047619047619
[2024-03-09 06:16:41,961 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 544 transitions.
[2024-03-09 06:16:41,961 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions.
[2024-03-09 06:16:41,962 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:41,962 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions.
[2024-03-09 06:16:41,963 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,964 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,964 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,964 INFO  L175             Difference]: Start difference. First operand has 128 places, 116 transitions, 268 flow. Second operand 6 states and 544 transitions.
[2024-03-09 06:16:41,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 494 flow
[2024-03-09 06:16:41,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 482 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:16:41,967 INFO  L231             Difference]: Finished difference. Result has 130 places, 153 transitions, 510 flow
[2024-03-09 06:16:41,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=130, PETRI_TRANSITIONS=153}
[2024-03-09 06:16:41,968 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places.
[2024-03-09 06:16:41,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 153 transitions, 510 flow
[2024-03-09 06:16:41,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:41,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:41,968 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:41,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 06:16:41,969 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:41,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:41,969 INFO  L85        PathProgramCache]: Analyzing trace with hash -1909822513, now seen corresponding path program 1 times
[2024-03-09 06:16:41,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:41,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114155521]
[2024-03-09 06:16:41,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:41,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:41,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:42,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:42,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:42,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114155521]
[2024-03-09 06:16:42,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114155521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:42,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:42,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:42,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409101623]
[2024-03-09 06:16:42,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:42,192 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:16:42,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:42,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:16:42,193 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:16:42,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 119
[2024-03-09 06:16:42,305 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 153 transitions, 510 flow. Second operand  has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:42,305 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:42,305 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 119
[2024-03-09 06:16:42,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:42,976 INFO  L124   PetriNetUnfolderBase]: 2605/6208 cut-off events.
[2024-03-09 06:16:42,976 INFO  L125   PetriNetUnfolderBase]: For 1573/1736 co-relation queries the response was YES.
[2024-03-09 06:16:42,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14073 conditions, 6208 events. 2605/6208 cut-off events. For 1573/1736 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 48716 event pairs, 747 based on Foata normal form. 0/5793 useless extension candidates. Maximal degree in co-relation 11520. Up to 3531 conditions per place. 
[2024-03-09 06:16:43,021 INFO  L140   encePairwiseOnDemand]: 92/119 looper letters, 71 selfloop transitions, 124 changer transitions 0/280 dead transitions.
[2024-03-09 06:16:43,022 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 280 transitions, 1400 flow
[2024-03-09 06:16:43,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:43,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:43,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions.
[2024-03-09 06:16:43,024 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8753501400560224
[2024-03-09 06:16:43,024 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 625 transitions.
[2024-03-09 06:16:43,024 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions.
[2024-03-09 06:16:43,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:43,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions.
[2024-03-09 06:16:43,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:43,027 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:43,027 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:43,027 INFO  L175             Difference]: Start difference. First operand has 130 places, 153 transitions, 510 flow. Second operand 6 states and 625 transitions.
[2024-03-09 06:16:43,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 280 transitions, 1400 flow
[2024-03-09 06:16:43,032 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 280 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:43,035 INFO  L231             Difference]: Finished difference. Result has 140 places, 272 transitions, 1554 flow
[2024-03-09 06:16:43,035 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1554, PETRI_PLACES=140, PETRI_TRANSITIONS=272}
[2024-03-09 06:16:43,036 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places.
[2024-03-09 06:16:43,036 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 272 transitions, 1554 flow
[2024-03-09 06:16:43,036 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:43,036 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:43,036 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:43,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 06:16:43,036 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:43,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:43,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 1790302882, now seen corresponding path program 1 times
[2024-03-09 06:16:43,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:43,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470147398]
[2024-03-09 06:16:43,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:43,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:43,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:43,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:16:43,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:43,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470147398]
[2024-03-09 06:16:43,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470147398] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:43,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:43,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:43,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052174938]
[2024-03-09 06:16:43,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:43,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:16:43,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:43,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:16:43,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:16:43,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 119
[2024-03-09 06:16:43,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 272 transitions, 1554 flow. Second operand  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:43,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:43,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 119
[2024-03-09 06:16:43,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:44,304 INFO  L124   PetriNetUnfolderBase]: 3224/7675 cut-off events.
[2024-03-09 06:16:44,304 INFO  L125   PetriNetUnfolderBase]: For 6719/7182 co-relation queries the response was YES.
[2024-03-09 06:16:44,318 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23266 conditions, 7675 events. 3224/7675 cut-off events. For 6719/7182 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 62393 event pairs, 459 based on Foata normal form. 0/7329 useless extension candidates. Maximal degree in co-relation 19055. Up to 3823 conditions per place. 
[2024-03-09 06:16:44,350 INFO  L140   encePairwiseOnDemand]: 98/119 looper letters, 170 selfloop transitions, 88 changer transitions 0/360 dead transitions.
[2024-03-09 06:16:44,351 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 360 transitions, 2634 flow
[2024-03-09 06:16:44,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:44,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:44,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2024-03-09 06:16:44,353 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8053221288515406
[2024-03-09 06:16:44,353 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2024-03-09 06:16:44,354 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2024-03-09 06:16:44,354 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:44,354 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2024-03-09 06:16:44,356 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:44,357 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:44,358 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:44,358 INFO  L175             Difference]: Start difference. First operand has 140 places, 272 transitions, 1554 flow. Second operand 6 states and 575 transitions.
[2024-03-09 06:16:44,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 360 transitions, 2634 flow
[2024-03-09 06:16:44,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 360 transitions, 2616 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:44,386 INFO  L231             Difference]: Finished difference. Result has 150 places, 352 transitions, 2504 flow
[2024-03-09 06:16:44,386 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2504, PETRI_PLACES=150, PETRI_TRANSITIONS=352}
[2024-03-09 06:16:44,386 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places.
[2024-03-09 06:16:44,387 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 352 transitions, 2504 flow
[2024-03-09 06:16:44,387 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:44,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:44,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:44,387 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 06:16:44,387 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:44,387 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:44,387 INFO  L85        PathProgramCache]: Analyzing trace with hash -1826722711, now seen corresponding path program 1 times
[2024-03-09 06:16:44,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:44,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475300366]
[2024-03-09 06:16:44,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:44,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:44,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:44,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:16:44,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:44,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475300366]
[2024-03-09 06:16:44,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475300366] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:16:44,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:16:44,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:16:44,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796858734]
[2024-03-09 06:16:44,610 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:16:44,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:16:44,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:44,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:16:44,611 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:16:44,816 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119
[2024-03-09 06:16:44,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 352 transitions, 2504 flow. Second operand  has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:44,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:44,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119
[2024-03-09 06:16:44,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:45,743 INFO  L124   PetriNetUnfolderBase]: 3687/8460 cut-off events.
[2024-03-09 06:16:45,744 INFO  L125   PetriNetUnfolderBase]: For 15132/15594 co-relation queries the response was YES.
[2024-03-09 06:16:45,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30651 conditions, 8460 events. 3687/8460 cut-off events. For 15132/15594 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 68052 event pairs, 333 based on Foata normal form. 0/8152 useless extension candidates. Maximal degree in co-relation 25534. Up to 4189 conditions per place. 
[2024-03-09 06:16:45,785 INFO  L140   encePairwiseOnDemand]: 104/119 looper letters, 206 selfloop transitions, 124 changer transitions 0/473 dead transitions.
[2024-03-09 06:16:45,786 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 473 transitions, 4302 flow
[2024-03-09 06:16:45,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:16:45,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:16:45,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions.
[2024-03-09 06:16:45,788 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8487394957983193
[2024-03-09 06:16:45,788 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 606 transitions.
[2024-03-09 06:16:45,788 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions.
[2024-03-09 06:16:45,788 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:45,788 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions.
[2024-03-09 06:16:45,789 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:45,790 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:45,791 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:45,791 INFO  L175             Difference]: Start difference. First operand has 150 places, 352 transitions, 2504 flow. Second operand 6 states and 606 transitions.
[2024-03-09 06:16:45,791 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 473 transitions, 4302 flow
[2024-03-09 06:16:45,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 473 transitions, 4062 flow, removed 120 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:45,832 INFO  L231             Difference]: Finished difference. Result has 160 places, 471 transitions, 3984 flow
[2024-03-09 06:16:45,832 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2360, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3984, PETRI_PLACES=160, PETRI_TRANSITIONS=471}
[2024-03-09 06:16:45,832 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places.
[2024-03-09 06:16:45,832 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 471 transitions, 3984 flow
[2024-03-09 06:16:45,833 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:45,833 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:45,833 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:45,833 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 06:16:45,833 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:45,833 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:45,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 107044070, now seen corresponding path program 1 times
[2024-03-09 06:16:45,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:45,834 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102282043]
[2024-03-09 06:16:45,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:45,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:45,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:46,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:46,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:46,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102282043]
[2024-03-09 06:16:46,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102282043] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:16:46,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851261724]
[2024-03-09 06:16:46,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:46,220 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:16:46,220 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:16:46,221 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:16:46,226 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 06:16:46,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:46,356 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-09 06:16:46,376 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:16:46,415 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:16:46,441 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:16:46,441 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:16:46,512 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-03-09 06:16:46,525 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-03-09 06:16:46,548 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:16:46,549 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-03-09 06:16:46,575 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:16:46,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-03-09 06:16:46,602 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34
[2024-03-09 06:16:46,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:46,614 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:16:46,642 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-09 06:16:46,664 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))))) is different from false
[2024-03-09 06:16:46,683 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-09 06:16:46,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:46,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [851261724] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:16:46,860 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:16:46,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18
[2024-03-09 06:16:46,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971176304]
[2024-03-09 06:16:46,861 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:16:46,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-09 06:16:46,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:46,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-09 06:16:46,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342
[2024-03-09 06:16:47,037 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 119
[2024-03-09 06:16:47,038 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 471 transitions, 3984 flow. Second operand  has 19 states, 19 states have (on average 56.89473684210526) internal successors, (1081), 19 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:47,038 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:47,038 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 119
[2024-03-09 06:16:47,038 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:16:52,754 INFO  L124   PetriNetUnfolderBase]: 11510/22613 cut-off events.
[2024-03-09 06:16:52,754 INFO  L125   PetriNetUnfolderBase]: For 44163/44193 co-relation queries the response was YES.
[2024-03-09 06:16:52,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85135 conditions, 22613 events. 11510/22613 cut-off events. For 44163/44193 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 190203 event pairs, 619 based on Foata normal form. 222/21774 useless extension candidates. Maximal degree in co-relation 76632. Up to 7166 conditions per place. 
[2024-03-09 06:16:52,943 INFO  L140   encePairwiseOnDemand]: 91/119 looper letters, 946 selfloop transitions, 553 changer transitions 43/1600 dead transitions.
[2024-03-09 06:16:52,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1600 transitions, 15564 flow
[2024-03-09 06:16:52,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-03-09 06:16:52,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-03-09 06:16:52,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2674 transitions.
[2024-03-09 06:16:52,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6073131955484896
[2024-03-09 06:16:52,950 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2674 transitions.
[2024-03-09 06:16:52,951 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2674 transitions.
[2024-03-09 06:16:52,952 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:16:52,952 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2674 transitions.
[2024-03-09 06:16:52,958 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 72.27027027027027) internal successors, (2674), 37 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:52,964 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:52,965 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:52,965 INFO  L175             Difference]: Start difference. First operand has 160 places, 471 transitions, 3984 flow. Second operand 37 states and 2674 transitions.
[2024-03-09 06:16:52,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1600 transitions, 15564 flow
[2024-03-09 06:16:53,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 1600 transitions, 15264 flow, removed 150 selfloop flow, removed 0 redundant places.
[2024-03-09 06:16:53,206 INFO  L231             Difference]: Finished difference. Result has 219 places, 918 transitions, 10189 flow
[2024-03-09 06:16:53,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=3822, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10189, PETRI_PLACES=219, PETRI_TRANSITIONS=918}
[2024-03-09 06:16:53,207 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 100 predicate places.
[2024-03-09 06:16:53,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 918 transitions, 10189 flow
[2024-03-09 06:16:53,208 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 56.89473684210526) internal successors, (1081), 19 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:53,208 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:53,208 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:53,218 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 06:16:53,409 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:16:53,410 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:53,411 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:53,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 868131320, now seen corresponding path program 1 times
[2024-03-09 06:16:53,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:53,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017287772]
[2024-03-09 06:16:53,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:53,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:53,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:53,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:53,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:53,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017287772]
[2024-03-09 06:16:53,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017287772] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:16:53,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481179329]
[2024-03-09 06:16:53,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:53,879 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:16:53,879 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:16:53,884 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:16:53,885 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 06:16:53,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:53,989 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-09 06:16:53,994 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:16:54,090 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:16:54,202 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:16:54,202 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:16:54,454 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:16:54,493 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:16:54,545 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:16:54,600 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:16:54,667 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:16:54,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:54,725 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:16:54,747 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-09 06:16:54,770 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2024-03-09 06:16:54,796 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 06:16:55,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:55,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481179329] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:16:55,054 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:16:55,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 37
[2024-03-09 06:16:55,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059331032]
[2024-03-09 06:16:55,055 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:16:55,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-03-09 06:16:55,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:55,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-03-09 06:16:55,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1057, Unknown=3, NotChecked=204, Total=1406
[2024-03-09 06:16:55,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-03-09 06:16:55,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 918 transitions, 10189 flow. Second operand  has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:55,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:55,213 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-03-09 06:16:55,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:17:08,106 INFO  L124   PetriNetUnfolderBase]: 21737/42230 cut-off events.
[2024-03-09 06:17:08,106 INFO  L125   PetriNetUnfolderBase]: For 311002/311153 co-relation queries the response was YES.
[2024-03-09 06:17:08,399 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 220770 conditions, 42230 events. 21737/42230 cut-off events. For 311002/311153 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 385781 event pairs, 2336 based on Foata normal form. 267/40335 useless extension candidates. Maximal degree in co-relation 211110. Up to 14507 conditions per place. 
[2024-03-09 06:17:08,580 INFO  L140   encePairwiseOnDemand]: 79/119 looper letters, 1732 selfloop transitions, 982 changer transitions 32/2796 dead transitions.
[2024-03-09 06:17:08,581 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 2796 transitions, 37755 flow
[2024-03-09 06:17:08,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2024-03-09 06:17:08,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2024-03-09 06:17:08,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2606 transitions.
[2024-03-09 06:17:08,588 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43798319327731094
[2024-03-09 06:17:08,588 INFO  L72            ComplementDD]: Start complementDD. Operand 50 states and 2606 transitions.
[2024-03-09 06:17:08,588 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 2606 transitions.
[2024-03-09 06:17:08,589 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:17:08,589 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2606 transitions.
[2024-03-09 06:17:08,596 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 51 states, 50 states have (on average 52.12) internal successors, (2606), 50 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:08,602 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:08,603 INFO  L81            ComplementDD]: Finished complementDD. Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:08,603 INFO  L175             Difference]: Start difference. First operand has 219 places, 918 transitions, 10189 flow. Second operand 50 states and 2606 transitions.
[2024-03-09 06:17:08,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 2796 transitions, 37755 flow
[2024-03-09 06:17:11,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 2796 transitions, 36383 flow, removed 681 selfloop flow, removed 3 redundant places.
[2024-03-09 06:17:11,844 INFO  L231             Difference]: Finished difference. Result has 283 places, 1804 transitions, 25440 flow
[2024-03-09 06:17:11,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=9657, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=25440, PETRI_PLACES=283, PETRI_TRANSITIONS=1804}
[2024-03-09 06:17:11,846 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 164 predicate places.
[2024-03-09 06:17:11,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 1804 transitions, 25440 flow
[2024-03-09 06:17:11,847 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:11,847 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:17:11,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:17:11,854 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 06:17:12,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-09 06:17:12,048 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:17:12,049 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:17:12,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 2010273922, now seen corresponding path program 2 times
[2024-03-09 06:17:12,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:17:12,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745696373]
[2024-03-09 06:17:12,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:17:12,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:17:12,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:17:12,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:17:12,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:17:12,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745696373]
[2024-03-09 06:17:12,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745696373] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:17:12,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800783676]
[2024-03-09 06:17:12,471 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 06:17:12,472 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:17:12,472 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:17:12,473 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:17:12,474 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 06:17:12,618 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 06:17:12,619 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:17:12,620 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-09 06:17:12,646 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:17:12,654 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:17:12,738 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:17:12,738 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:17:12,941 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:17:12,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:17:13,018 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:17:13,098 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:17:13,245 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:17:13,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:17:13,298 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:17:13,470 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-09 06:17:13,494 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-03-09 06:17:13,515 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 06:17:13,537 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-03-09 06:17:13,564 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:17:13,564 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-03-09 06:17:13,571 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:17:13,572 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-03-09 06:17:13,575 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-03-09 06:17:13,586 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:17:13,587 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:17:13,596 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:17:13,596 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:17:13,604 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:17:13,605 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:17:13,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:17:13,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [800783676] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:17:13,648 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:17:13,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31
[2024-03-09 06:17:13,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927195251]
[2024-03-09 06:17:13,649 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:17:13,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-09 06:17:13,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:17:13,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-09 06:17:13,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=644, Unknown=11, NotChecked=220, Total=992
[2024-03-09 06:17:13,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-09 06:17:13,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1804 transitions, 25440 flow. Second operand  has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:13,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:17:13,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-09 06:17:13,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:17:39,242 INFO  L124   PetriNetUnfolderBase]: 34035/67700 cut-off events.
[2024-03-09 06:17:39,243 INFO  L125   PetriNetUnfolderBase]: For 815801/816163 co-relation queries the response was YES.
[2024-03-09 06:17:39,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 395018 conditions, 67700 events. 34035/67700 cut-off events. For 815801/816163 co-relation queries the response was YES. Maximal size of possible extension queue 1919. Compared 677800 event pairs, 3868 based on Foata normal form. 158/64849 useless extension candidates. Maximal degree in co-relation 386047. Up to 24266 conditions per place. 
[2024-03-09 06:17:40,324 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2302 selfloop transitions, 1329 changer transitions 38/3734 dead transitions.
[2024-03-09 06:17:40,324 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 3734 transitions, 59987 flow
[2024-03-09 06:17:40,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-03-09 06:17:40,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-03-09 06:17:40,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2550 transitions.
[2024-03-09 06:17:40,328 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5791505791505791
[2024-03-09 06:17:40,328 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2550 transitions.
[2024-03-09 06:17:40,328 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2550 transitions.
[2024-03-09 06:17:40,329 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:17:40,329 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2550 transitions.
[2024-03-09 06:17:40,332 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 68.91891891891892) internal successors, (2550), 37 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:40,336 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:40,336 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:40,337 INFO  L175             Difference]: Start difference. First operand has 283 places, 1804 transitions, 25440 flow. Second operand 37 states and 2550 transitions.
[2024-03-09 06:17:40,337 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 3734 transitions, 59987 flow
[2024-03-09 06:17:50,600 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3734 transitions, 59733 flow, removed 100 selfloop flow, removed 17 redundant places.
[2024-03-09 06:17:50,643 INFO  L231             Difference]: Finished difference. Result has 322 places, 2617 transitions, 44520 flow
[2024-03-09 06:17:50,644 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=25278, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=44520, PETRI_PLACES=322, PETRI_TRANSITIONS=2617}
[2024-03-09 06:17:50,645 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 203 predicate places.
[2024-03-09 06:17:50,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 2617 transitions, 44520 flow
[2024-03-09 06:17:50,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:50,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:17:50,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:17:50,650 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 06:17:50,850 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:17:50,850 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:17:50,851 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:17:50,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 565757044, now seen corresponding path program 3 times
[2024-03-09 06:17:50,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:17:50,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690027514]
[2024-03-09 06:17:50,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:17:50,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:17:50,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:17:51,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:17:51,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:17:51,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690027514]
[2024-03-09 06:17:51,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690027514] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:17:51,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895551120]
[2024-03-09 06:17:51,180 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 06:17:51,180 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:17:51,180 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:17:51,181 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:17:51,182 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 06:17:51,278 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 06:17:51,278 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:17:51,279 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-09 06:17:51,282 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:17:51,288 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:17:51,347 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:17:51,347 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:17:51,522 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:17:51,602 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:17:51,653 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:17:51,700 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:17:51,767 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:17:51,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:17:51,806 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:17:51,828 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-09 06:17:51,860 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false
[2024-03-09 06:17:51,879 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 06:17:51,899 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-03-09 06:17:51,957 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 06:17:51,977 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:17:51,977 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 06:17:51,983 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:17:51,983 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 06:17:51,987 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 06:17:52,002 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:17:52,002 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:17:52,010 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:17:52,010 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:17:52,018 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:17:52,018 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 06:17:52,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:17:52,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895551120] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:17:52,104 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:17:52,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33
[2024-03-09 06:17:52,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909503802]
[2024-03-09 06:17:52,105 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:17:52,105 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-03-09 06:17:52,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:17:52,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-03-09 06:17:52,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=719, Unknown=5, NotChecked=290, Total=1122
[2024-03-09 06:17:52,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-09 06:17:52,228 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 2617 transitions, 44520 flow. Second operand  has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:17:52,228 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:17:52,228 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-09 06:17:52,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:18:33,735 INFO  L124   PetriNetUnfolderBase]: 41284/81095 cut-off events.
[2024-03-09 06:18:33,735 INFO  L125   PetriNetUnfolderBase]: For 1186009/1186675 co-relation queries the response was YES.
[2024-03-09 06:18:34,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 517213 conditions, 81095 events. 41284/81095 cut-off events. For 1186009/1186675 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 816947 event pairs, 4310 based on Foata normal form. 399/77964 useless extension candidates. Maximal degree in co-relation 514356. Up to 30004 conditions per place. 
[2024-03-09 06:18:35,019 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2623 selfloop transitions, 2150 changer transitions 35/4873 dead transitions.
[2024-03-09 06:18:35,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4873 transitions, 90219 flow
[2024-03-09 06:18:35,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-09 06:18:35,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-09 06:18:35,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2742 transitions.
[2024-03-09 06:18:35,023 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5760504201680672
[2024-03-09 06:18:35,023 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2742 transitions.
[2024-03-09 06:18:35,023 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2742 transitions.
[2024-03-09 06:18:35,024 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:18:35,024 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2742 transitions.
[2024-03-09 06:18:35,027 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 68.55) internal successors, (2742), 40 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:18:35,030 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:18:35,031 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:18:35,031 INFO  L175             Difference]: Start difference. First operand has 322 places, 2617 transitions, 44520 flow. Second operand 40 states and 2742 transitions.
[2024-03-09 06:18:35,031 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 4873 transitions, 90219 flow
[2024-03-09 06:18:55,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4873 transitions, 89529 flow, removed 297 selfloop flow, removed 14 redundant places.
[2024-03-09 06:18:55,620 INFO  L231             Difference]: Finished difference. Result has 368 places, 3656 transitions, 73189 flow
[2024-03-09 06:18:55,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=44102, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=73189, PETRI_PLACES=368, PETRI_TRANSITIONS=3656}
[2024-03-09 06:18:55,623 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 249 predicate places.
[2024-03-09 06:18:55,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 368 places, 3656 transitions, 73189 flow
[2024-03-09 06:18:55,626 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:18:55,627 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:18:55,627 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:18:55,632 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 06:18:55,828 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-09 06:18:55,828 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:18:55,829 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:18:55,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507148684, now seen corresponding path program 4 times
[2024-03-09 06:18:55,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:18:55,829 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967493917]
[2024-03-09 06:18:55,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:18:55,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:18:55,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:18:56,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:18:56,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:18:56,173 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967493917]
[2024-03-09 06:18:56,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967493917] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:18:56,173 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315314638]
[2024-03-09 06:18:56,173 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 06:18:56,173 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:18:56,173 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:18:56,174 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:18:56,176 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 06:18:56,374 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 06:18:56,375 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:18:56,376 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-03-09 06:18:56,381 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:18:56,387 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:18:56,446 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:18:56,446 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:18:56,670 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:18:56,706 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:18:56,767 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:18:56,899 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:18:56,974 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41
[2024-03-09 06:18:57,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:18:57,020 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:19:17,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:19:17,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [315314638] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:19:17,949 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:19:17,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38
[2024-03-09 06:19:17,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775128344]
[2024-03-09 06:19:17,949 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:19:17,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2024-03-09 06:19:17,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:19:17,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-03-09 06:19:17,950 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1300, Unknown=4, NotChecked=0, Total=1482
[2024-03-09 06:19:22,458 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:27,486 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:31,778 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:36,102 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:40,174 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:44,429 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:48,692 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:52,962 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:19:57,590 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:01,947 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:06,225 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:10,830 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:15,350 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:20,256 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:24,477 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:29,518 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:34,249 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:38,792 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:42,817 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:47,021 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:51,431 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:55,662 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:20:57,480 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:21:01,489 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:21:05,726 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:21:09,925 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:21:14,487 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:21:19,604 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 06:21:19,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-09 06:21:19,724 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 3656 transitions, 73189 flow. Second operand  has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:21:19,724 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:21:19,724 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-09 06:21:19,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:22:33,913 INFO  L124   PetriNetUnfolderBase]: 46962/92430 cut-off events.
[2024-03-09 06:22:33,913 INFO  L125   PetriNetUnfolderBase]: For 1987278/1988026 co-relation queries the response was YES.
[2024-03-09 06:22:35,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 646811 conditions, 92430 events. 46962/92430 cut-off events. For 1987278/1988026 co-relation queries the response was YES. Maximal size of possible extension queue 2541. Compared 948880 event pairs, 4632 based on Foata normal form. 321/88776 useless extension candidates. Maximal degree in co-relation 642957. Up to 34570 conditions per place. 
[2024-03-09 06:22:35,742 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2996 selfloop transitions, 2313 changer transitions 38/5412 dead transitions.
[2024-03-09 06:22:35,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 5412 transitions, 114848 flow
[2024-03-09 06:22:35,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-09 06:22:35,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-09 06:22:35,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2734 transitions.
[2024-03-09 06:22:35,746 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5743697478991596
[2024-03-09 06:22:35,746 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2734 transitions.
[2024-03-09 06:22:35,747 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2734 transitions.
[2024-03-09 06:22:35,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:22:35,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2734 transitions.
[2024-03-09 06:22:35,750 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 68.35) internal successors, (2734), 40 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:22:35,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:22:35,754 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:22:35,754 INFO  L175             Difference]: Start difference. First operand has 368 places, 3656 transitions, 73189 flow. Second operand 40 states and 2734 transitions.
[2024-03-09 06:22:35,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 5412 transitions, 114848 flow
[2024-03-09 06:23:09,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 5412 transitions, 111590 flow, removed 1568 selfloop flow, removed 15 redundant places.
[2024-03-09 06:23:09,508 INFO  L231             Difference]: Finished difference. Result has 412 places, 4308 transitions, 94931 flow
[2024-03-09 06:23:09,511 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=70607, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1703, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=94931, PETRI_PLACES=412, PETRI_TRANSITIONS=4308}
[2024-03-09 06:23:09,511 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 293 predicate places.
[2024-03-09 06:23:09,512 INFO  L495      AbstractCegarLoop]: Abstraction has has 412 places, 4308 transitions, 94931 flow
[2024-03-09 06:23:09,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:23:09,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:23:09,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:23:09,521 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-03-09 06:23:09,713 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:23:09,714 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:23:09,714 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:23:09,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -50739582, now seen corresponding path program 5 times
[2024-03-09 06:23:09,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:23:09,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382808929]
[2024-03-09 06:23:09,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:23:09,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:23:09,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:23:10,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:23:10,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:23:10,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382808929]
[2024-03-09 06:23:10,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382808929] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:23:10,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219339071]
[2024-03-09 06:23:10,119 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-09 06:23:10,119 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:23:10,120 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:23:10,121 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:23:10,122 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 06:23:10,226 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 06:23:10,226 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:23:10,228 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-09 06:23:10,231 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:23:10,364 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:23:10,528 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:23:10,529 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:23:10,816 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:23:10,868 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:23:11,035 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:23:11,106 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:23:11,216 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:23:11,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:23:11,274 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:23:11,302 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-09 06:23:11,350 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)))) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2024-03-09 06:23:12,011 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:23:12,011 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 06:23:12,017 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:23:12,017 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 06:23:12,021 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 06:23:12,028 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:23:12,028 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:23:12,034 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:23:12,035 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 06:23:12,040 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:23:12,040 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:23:12,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:23:12,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219339071] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:23:12,211 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:23:12,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 39
[2024-03-09 06:23:12,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739711864]
[2024-03-09 06:23:12,212 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:23:12,212 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-03-09 06:23:12,213 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:23:12,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-03-09 06:23:12,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1236, Unknown=32, NotChecked=146, Total=1560
[2024-03-09 06:23:12,857 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-03-09 06:23:12,859 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 4308 transitions, 94931 flow. Second operand  has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:23:12,860 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:23:12,860 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-03-09 06:23:12,860 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:24:45,671 INFO  L124   PetriNetUnfolderBase]: 52743/103315 cut-off events.
[2024-03-09 06:24:45,672 INFO  L125   PetriNetUnfolderBase]: For 2415049/2416110 co-relation queries the response was YES.
[2024-03-09 06:24:47,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 753484 conditions, 103315 events. 52743/103315 cut-off events. For 2415049/2416110 co-relation queries the response was YES. Maximal size of possible extension queue 2772. Compared 1069576 event pairs, 4973 based on Foata normal form. 522/99383 useless extension candidates. Maximal degree in co-relation 748384. Up to 38949 conditions per place. 
[2024-03-09 06:24:48,112 INFO  L140   encePairwiseOnDemand]: 74/119 looper letters, 3317 selfloop transitions, 2903 changer transitions 40/6310 dead transitions.
[2024-03-09 06:24:48,112 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 6310 transitions, 144714 flow
[2024-03-09 06:24:48,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2024-03-09 06:24:48,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2024-03-09 06:24:48,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2670 transitions.
[2024-03-09 06:24:48,119 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44873949579831934
[2024-03-09 06:24:48,119 INFO  L72            ComplementDD]: Start complementDD. Operand 50 states and 2670 transitions.
[2024-03-09 06:24:48,119 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 2670 transitions.
[2024-03-09 06:24:48,120 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:24:48,120 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2670 transitions.
[2024-03-09 06:24:48,124 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 51 states, 50 states have (on average 53.4) internal successors, (2670), 50 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:24:48,129 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:24:48,130 INFO  L81            ComplementDD]: Finished complementDD. Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:24:48,130 INFO  L175             Difference]: Start difference. First operand has 412 places, 4308 transitions, 94931 flow. Second operand 50 states and 2670 transitions.
[2024-03-09 06:24:48,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 6310 transitions, 144714 flow
[2024-03-09 06:25:34,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 6310 transitions, 143297 flow, removed 618 selfloop flow, removed 18 redundant places.
[2024-03-09 06:25:34,824 INFO  L231             Difference]: Finished difference. Result has 463 places, 5049 transitions, 123932 flow
[2024-03-09 06:25:34,827 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=93842, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=123932, PETRI_PLACES=463, PETRI_TRANSITIONS=5049}
[2024-03-09 06:25:34,828 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 344 predicate places.
[2024-03-09 06:25:34,828 INFO  L495      AbstractCegarLoop]: Abstraction has has 463 places, 5049 transitions, 123932 flow
[2024-03-09 06:25:34,828 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:25:34,828 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:25:34,828 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:25:34,837 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-03-09 06:25:35,029 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-09 06:25:35,030 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:25:35,030 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:25:35,031 INFO  L85        PathProgramCache]: Analyzing trace with hash -1091376008, now seen corresponding path program 6 times
[2024-03-09 06:25:35,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:25:35,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467946029]
[2024-03-09 06:25:35,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:25:35,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:25:35,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:25:35,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:25:35,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:25:35,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467946029]
[2024-03-09 06:25:35,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467946029] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:25:35,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279439108]
[2024-03-09 06:25:35,465 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-09 06:25:35,465 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:25:35,465 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:25:35,467 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:25:35,468 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 06:25:35,598 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-09 06:25:35,598 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:25:35,599 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-09 06:25:35,602 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:25:35,607 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:25:35,687 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:25:35,688 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:25:35,907 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:25:35,952 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:25:36,008 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:25:36,081 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:25:36,348 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:25:36,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:25:36,401 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:25:36,428 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-09 06:25:36,504 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-09 06:25:37,039 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 06:25:37,064 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:25:37,064 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-03-09 06:25:37,068 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:25:37,068 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-03-09 06:25:37,071 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-03-09 06:25:37,078 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:25:37,078 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:25:37,089 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:25:37,089 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:25:37,096 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:25:37,096 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:25:37,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:25:37,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279439108] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:25:37,223 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:25:37,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34
[2024-03-09 06:25:37,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043337617]
[2024-03-09 06:25:37,224 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:25:37,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-09 06:25:37,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:25:37,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-09 06:25:37,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=812, Unknown=48, NotChecked=186, Total=1190
[2024-03-09 06:25:37,540 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-03-09 06:25:37,541 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 5049 transitions, 123932 flow. Second operand  has 35 states, 35 states have (on average 52.94285714285714) internal successors, (1853), 35 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:25:37,541 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:25:37,541 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-03-09 06:25:37,542 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:27:30,292 INFO  L124   PetriNetUnfolderBase]: 56599/112313 cut-off events.
[2024-03-09 06:27:30,292 INFO  L125   PetriNetUnfolderBase]: For 2915133/2916278 co-relation queries the response was YES.
[2024-03-09 06:27:32,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 851584 conditions, 112313 events. 56599/112313 cut-off events. For 2915133/2916278 co-relation queries the response was YES. Maximal size of possible extension queue 3096. Compared 1191460 event pairs, 6269 based on Foata normal form. 472/108015 useless extension candidates. Maximal degree in co-relation 846042. Up to 57747 conditions per place. 
[2024-03-09 06:27:33,461 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 3071 selfloop transitions, 2882 changer transitions 34/6053 dead transitions.
[2024-03-09 06:27:33,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 6053 transitions, 156988 flow
[2024-03-09 06:27:33,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-03-09 06:27:33,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-03-09 06:27:33,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1937 transitions.
[2024-03-09 06:27:33,464 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5612865835989568
[2024-03-09 06:27:33,465 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 1937 transitions.
[2024-03-09 06:27:33,465 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 1937 transitions.
[2024-03-09 06:27:33,465 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:27:33,465 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1937 transitions.
[2024-03-09 06:27:33,467 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 66.79310344827586) internal successors, (1937), 29 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:27:33,469 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:27:33,470 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:27:33,470 INFO  L175             Difference]: Start difference. First operand has 463 places, 5049 transitions, 123932 flow. Second operand 29 states and 1937 transitions.
[2024-03-09 06:27:33,470 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 6053 transitions, 156988 flow
[2024-03-09 06:28:40,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 6053 transitions, 155596 flow, removed 626 selfloop flow, removed 20 redundant places.
[2024-03-09 06:28:41,013 INFO  L231             Difference]: Finished difference. Result has 487 places, 5570 transitions, 148812 flow
[2024-03-09 06:28:41,016 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=122552, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=148812, PETRI_PLACES=487, PETRI_TRANSITIONS=5570}
[2024-03-09 06:28:41,017 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 368 predicate places.
[2024-03-09 06:28:41,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 487 places, 5570 transitions, 148812 flow
[2024-03-09 06:28:41,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 52.94285714285714) internal successors, (1853), 35 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:28:41,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:28:41,018 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:28:41,023 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 06:28:41,222 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-09 06:28:41,222 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:28:41,224 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:28:41,224 INFO  L85        PathProgramCache]: Analyzing trace with hash -1120615654, now seen corresponding path program 7 times
[2024-03-09 06:28:41,224 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:28:41,224 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256144501]
[2024-03-09 06:28:41,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:28:41,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:28:41,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:28:41,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:28:41,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:28:41,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256144501]
[2024-03-09 06:28:41,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256144501] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:28:41,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950459498]
[2024-03-09 06:28:41,669 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-03-09 06:28:41,669 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:28:41,669 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:28:41,670 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:28:41,671 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 06:28:41,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:28:41,768 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-09 06:28:41,771 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:28:41,908 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:28:42,097 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:28:42,097 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:28:42,356 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:28:42,553 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:28:42,621 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:28:42,708 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:28:42,804 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:28:42,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:28:42,878 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:28:42,906 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-09 06:28:43,193 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)))) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)))))) is different from false
[2024-03-09 06:28:43,904 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 06:28:43,926 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:28:43,927 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 06:28:43,940 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:28:43,941 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 06:28:43,946 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 06:28:43,955 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:28:43,956 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:28:43,964 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:28:43,964 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 06:28:43,972 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 06:28:43,972 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 06:28:44,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:28:44,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [950459498] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:28:44,193 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:28:44,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 40
[2024-03-09 06:28:44,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876614546]
[2024-03-09 06:28:44,193 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:28:44,194 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2024-03-09 06:28:44,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:28:44,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2024-03-09 06:28:44,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1217, Unknown=51, NotChecked=222, Total=1640
[2024-03-09 06:28:44,568 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-03-09 06:28:44,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 5570 transitions, 148812 flow. Second operand  has 41 states, 41 states have (on average 40.24390243902439) internal successors, (1650), 41 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:28:44,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:28:44,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-03-09 06:28:44,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
