./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/reorder_c11_good-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/reorder_c11_good-50.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/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 a3b533c73361ee15e10e9133a2147995318be27bb7652d57aee6ac7672acea5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:35:40,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:35:40,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:35:40,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:35:40,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:35:40,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:35:40,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:35:40,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:35:40,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:35:40,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:35:40,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:35:40,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:35:40,375 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:35:40,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:35:40,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:35:40,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:35:40,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:40,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:35:40,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:40,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:35:40,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:35:40,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:35:40,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:35:40,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:35:40,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:35:40,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:35:40,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:35:40,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:35:40,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:35:40,378 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/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 -> a3b533c73361ee15e10e9133a2147995318be27bb7652d57aee6ac7672acea5b [2025-01-09 21:35:40,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:35:40,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:35:40,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:35:40,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:35:40,620 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:35:40,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/reorder_c11_good-50.i [2025-01-09 21:35:41,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477ad77e8/c3cdf3b60434408b8771ab874ff92985/FLAG9910180cf [2025-01-09 21:35:42,019 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:35:42,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/reorder_c11_good-50.i [2025-01-09 21:35:42,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477ad77e8/c3cdf3b60434408b8771ab874ff92985/FLAG9910180cf [2025-01-09 21:35:42,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477ad77e8/c3cdf3b60434408b8771ab874ff92985 [2025-01-09 21:35:42,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:35:42,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:35:42,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:35:42,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:35:42,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:35:42,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4c02a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42, skipping insertion in model container [2025-01-09 21:35:42,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:35:42,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:35:42,512 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:35:42,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:35:42,572 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:35:42,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42 WrapperNode [2025-01-09 21:35:42,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:35:42,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:35:42,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:35:42,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:35:42,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,609 INFO L138 Inliner]: procedures = 163, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-01-09 21:35:42,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:35:42,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:35:42,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:35:42,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:35:42,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:35:42,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:35:42,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:35:42,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:35:42,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (1/1) ... [2025-01-09 21:35:42,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:42,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:35:42,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:35:42,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:35:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:35:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-09 21:35:42,678 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-09 21:35:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:35:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:35:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:35:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:35:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:35:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-09 21:35:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-09 21:35:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:35:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:35:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:35:42,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:35:42,681 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:35:42,785 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:35:42,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:35:43,029 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:35:43,029 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:35:43,046 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:35:43,046 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 21:35:43,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:35:43 BoogieIcfgContainer [2025-01-09 21:35:43,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:35:43,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:35:43,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:35:43,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:35:43,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:35:42" (1/3) ... [2025-01-09 21:35:43,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb37013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:35:43, skipping insertion in model container [2025-01-09 21:35:43,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:42" (2/3) ... [2025-01-09 21:35:43,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb37013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:35:43, skipping insertion in model container [2025-01-09 21:35:43,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:35:43" (3/3) ... [2025-01-09 21:35:43,053 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_c11_good-50.i [2025-01-09 21:35:43,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:35:43,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_c11_good-50.i that has 3 procedures, 203 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-01-09 21:35:43,063 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:35:43,128 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:35:43,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 217 transitions, 454 flow [2025-01-09 21:35:43,321 INFO L124 PetriNetUnfolderBase]: 32/556 cut-off events. [2025-01-09 21:35:43,325 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:35:43,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 556 events. 32/556 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2203 event pairs, 0 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 266. Up to 8 conditions per place. [2025-01-09 21:35:43,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 217 transitions, 454 flow [2025-01-09 21:35:43,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 217 transitions, 454 flow [2025-01-09 21:35:43,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:35:43,366 INFO L333 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, 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;@335d2d11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:35:43,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 21:35:43,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:35:43,372 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:35:43,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:35:43,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:43,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:43,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:43,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1843953371, now seen corresponding path program 1 times [2025-01-09 21:35:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063896944] [2025-01-09 21:35:43,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:43,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:35:43,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:35:43,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:43,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063896944] [2025-01-09 21:35:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063896944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:43,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502644234] [2025-01-09 21:35:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:43,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:43,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:43,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:43,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-01-09 21:35:43,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 217 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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) [2025-01-09 21:35:43,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:43,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-01-09 21:35:43,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:43,801 INFO L124 PetriNetUnfolderBase]: 85/973 cut-off events. [2025-01-09 21:35:43,801 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-01-09 21:35:43,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 973 events. 85/973 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5288 event pairs, 64 based on Foata normal form. 45/838 useless extension candidates. Maximal degree in co-relation 872. Up to 207 conditions per place. [2025-01-09 21:35:43,808 INFO L140 encePairwiseOnDemand]: 207/217 looper letters, 31 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-01-09 21:35:43,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 486 flow [2025-01-09 21:35:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-01-09 21:35:43,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602150537634409 [2025-01-09 21:35:43,818 INFO L175 Difference]: Start difference. First operand has 209 places, 217 transitions, 454 flow. Second operand 3 states and 560 transitions. [2025-01-09 21:35:43,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 486 flow [2025-01-09 21:35:43,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:35:43,859 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 424 flow [2025-01-09 21:35:43,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2025-01-09 21:35:43,863 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -9 predicate places. [2025-01-09 21:35:43,863 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 424 flow [2025-01-09 21:35:43,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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) [2025-01-09 21:35:43,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:43,864 INFO L206 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] [2025-01-09 21:35:43,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:35:43,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 583588945, now seen corresponding path program 1 times [2025-01-09 21:35:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:43,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571018677] [2025-01-09 21:35:43,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:43,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:35:43,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:35:43,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:43,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:43,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:43,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571018677] [2025-01-09 21:35:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571018677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:43,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:43,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970873266] [2025-01-09 21:35:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:43,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:43,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:43,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:44,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 217 [2025-01-09 21:35:44,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 200 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2025-01-09 21:35:44,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:44,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 217 [2025-01-09 21:35:44,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:44,121 INFO L124 PetriNetUnfolderBase]: 117/982 cut-off events. [2025-01-09 21:35:44,121 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-09 21:35:44,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 982 events. 117/982 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5242 event pairs, 78 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1281. Up to 243 conditions per place. [2025-01-09 21:35:44,126 INFO L140 encePairwiseOnDemand]: 194/217 looper letters, 31 selfloop transitions, 11 changer transitions 0/190 dead transitions. [2025-01-09 21:35:44,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 488 flow [2025-01-09 21:35:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-01-09 21:35:44,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972350230414746 [2025-01-09 21:35:44,131 INFO L175 Difference]: Start difference. First operand has 200 places, 200 transitions, 424 flow. Second operand 3 states and 519 transitions. [2025-01-09 21:35:44,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 488 flow [2025-01-09 21:35:44,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 190 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:44,135 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 418 flow [2025-01-09 21:35:44,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2025-01-09 21:35:44,136 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -21 predicate places. [2025-01-09 21:35:44,136 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 418 flow [2025-01-09 21:35:44,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2025-01-09 21:35:44,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:44,137 INFO L206 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] [2025-01-09 21:35:44,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:35:44,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:44,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1709711193, now seen corresponding path program 1 times [2025-01-09 21:35:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:44,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523040927] [2025-01-09 21:35:44,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:44,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:35:44,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:35:44,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:44,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:44,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523040927] [2025-01-09 21:35:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523040927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:44,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:44,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:35:44,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85630551] [2025-01-09 21:35:44,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:44,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:44,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:44,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:44,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 217 [2025-01-09 21:35:44,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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) [2025-01-09 21:35:44,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:44,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 217 [2025-01-09 21:35:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:44,328 INFO L124 PetriNetUnfolderBase]: 27/504 cut-off events. [2025-01-09 21:35:44,328 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2025-01-09 21:35:44,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 504 events. 27/504 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1541 event pairs, 10 based on Foata normal form. 6/458 useless extension candidates. Maximal degree in co-relation 436. Up to 39 conditions per place. [2025-01-09 21:35:44,330 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 17 selfloop transitions, 8 changer transitions 9/193 dead transitions. [2025-01-09 21:35:44,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 193 transitions, 486 flow [2025-01-09 21:35:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2025-01-09 21:35:44,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032258064516129 [2025-01-09 21:35:44,332 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 418 flow. Second operand 3 states and 588 transitions. [2025-01-09 21:35:44,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 193 transitions, 486 flow [2025-01-09 21:35:44,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:44,335 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 412 flow [2025-01-09 21:35:44,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2025-01-09 21:35:44,336 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -20 predicate places. [2025-01-09 21:35:44,336 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 412 flow [2025-01-09 21:35:44,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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) [2025-01-09 21:35:44,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:44,336 INFO L206 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] [2025-01-09 21:35:44,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:35:44,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:44,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2097081629, now seen corresponding path program 1 times [2025-01-09 21:35:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:44,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551888898] [2025-01-09 21:35:44,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:44,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:35:44,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:35:44,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:44,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:44,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551888898] [2025-01-09 21:35:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551888898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744943868] [2025-01-09 21:35:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:44,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:35:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:44,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:35:44,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:35:44,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 217 [2025-01-09 21:35:44,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 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) [2025-01-09 21:35:44,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:44,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 217 [2025-01-09 21:35:44,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:45,040 INFO L124 PetriNetUnfolderBase]: 83/713 cut-off events. [2025-01-09 21:35:45,041 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:35:45,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 713 events. 83/713 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2704 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 794. Up to 193 conditions per place. [2025-01-09 21:35:45,045 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 42 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-01-09 21:35:45,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 520 flow [2025-01-09 21:35:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2025-01-09 21:35:45,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010752688172043 [2025-01-09 21:35:45,051 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 412 flow. Second operand 6 states and 1043 transitions. [2025-01-09 21:35:45,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 520 flow [2025-01-09 21:35:45,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 187 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:45,055 INFO L231 Difference]: Finished difference. Result has 183 places, 179 transitions, 412 flow [2025-01-09 21:35:45,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=183, PETRI_TRANSITIONS=179} [2025-01-09 21:35:45,060 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -26 predicate places. [2025-01-09 21:35:45,060 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 412 flow [2025-01-09 21:35:45,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 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) [2025-01-09 21:35:45,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:45,061 INFO L206 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] [2025-01-09 21:35:45,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:35:45,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash -458749502, now seen corresponding path program 1 times [2025-01-09 21:35:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407549352] [2025-01-09 21:35:45,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:45,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:35:45,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:35:45,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:45,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407549352] [2025-01-09 21:35:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407549352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:45,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:45,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673340890] [2025-01-09 21:35:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:45,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:45,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:45,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:45,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-01-09 21:35:45,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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) [2025-01-09 21:35:45,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:45,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-01-09 21:35:45,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:45,268 INFO L124 PetriNetUnfolderBase]: 63/695 cut-off events. [2025-01-09 21:35:45,268 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:35:45,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 695 events. 63/695 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2662 event pairs, 49 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 728. Up to 151 conditions per place. [2025-01-09 21:35:45,272 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 32 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2025-01-09 21:35:45,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 482 flow [2025-01-09 21:35:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-01-09 21:35:45,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509984639016898 [2025-01-09 21:35:45,277 INFO L175 Difference]: Start difference. First operand has 183 places, 179 transitions, 412 flow. Second operand 3 states and 554 transitions. [2025-01-09 21:35:45,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 180 transitions, 482 flow [2025-01-09 21:35:45,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 180 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:35:45,280 INFO L231 Difference]: Finished difference. Result has 179 places, 178 transitions, 404 flow [2025-01-09 21:35:45,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=179, PETRI_TRANSITIONS=178} [2025-01-09 21:35:45,281 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -30 predicate places. [2025-01-09 21:35:45,283 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 178 transitions, 404 flow [2025-01-09 21:35:45,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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) [2025-01-09 21:35:45,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:45,284 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:45,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:35:45,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:45,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:45,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1953558655, now seen corresponding path program 1 times [2025-01-09 21:35:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113997847] [2025-01-09 21:35:45,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:45,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:35:45,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:35:45,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:45,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113997847] [2025-01-09 21:35:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113997847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:45,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98047331] [2025-01-09 21:35:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:45,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:35:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:45,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:35:45,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:35:45,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2025-01-09 21:35:45,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 178 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 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) [2025-01-09 21:35:45,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:45,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2025-01-09 21:35:45,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:45,556 INFO L124 PetriNetUnfolderBase]: 6/115 cut-off events. [2025-01-09 21:35:45,556 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:35:45,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 115 events. 6/115 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 3/117 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2025-01-09 21:35:45,557 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 11 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-01-09 21:35:45,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 156 flow [2025-01-09 21:35:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2025-01-09 21:35:45,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417818740399385 [2025-01-09 21:35:45,560 INFO L175 Difference]: Start difference. First operand has 179 places, 178 transitions, 404 flow. Second operand 6 states and 1096 transitions. [2025-01-09 21:35:45,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 156 flow [2025-01-09 21:35:45,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:35:45,561 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 114 flow [2025-01-09 21:35:45,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-01-09 21:35:45,562 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -149 predicate places. [2025-01-09 21:35:45,562 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 114 flow [2025-01-09 21:35:45,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 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) [2025-01-09 21:35:45,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:45,563 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:35:45,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:35:45,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1790508814, now seen corresponding path program 1 times [2025-01-09 21:35:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112376475] [2025-01-09 21:35:45,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:45,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:35:45,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:35:45,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:45,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:45,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:35:45,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:35:45,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:35:45,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:45,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:45,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:35:45,623 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:35:45,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-01-09 21:35:45,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-01-09 21:35:45,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-01-09 21:35:45,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-01-09 21:35:45,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-01-09 21:35:45,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-01-09 21:35:45,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-01-09 21:35:45,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:35:45,630 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:45,632 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:35:45,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:35:45,677 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-09 21:35:45,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 270 transitions, 584 flow [2025-01-09 21:35:45,797 INFO L124 PetriNetUnfolderBase]: 131/1806 cut-off events. [2025-01-09 21:35:45,797 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 21:35:45,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1806 events. 131/1806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10364 event pairs, 2 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 1024. Up to 32 conditions per place. [2025-01-09 21:35:45,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 270 transitions, 584 flow [2025-01-09 21:35:45,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 270 transitions, 584 flow [2025-01-09 21:35:45,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:35:45,817 INFO L333 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, 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;@335d2d11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:35:45,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-01-09 21:35:45,819 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:35:45,819 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:35:45,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:35:45,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:45,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:45,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:45,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1421939237, now seen corresponding path program 1 times [2025-01-09 21:35:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:45,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935069878] [2025-01-09 21:35:45,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:45,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:35:45,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:35:45,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:45,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935069878] [2025-01-09 21:35:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935069878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015516571] [2025-01-09 21:35:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:45,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:45,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:45,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:45,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-01-09 21:35:45,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 270 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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) [2025-01-09 21:35:45,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:45,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-01-09 21:35:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:46,567 INFO L124 PetriNetUnfolderBase]: 1200/6906 cut-off events. [2025-01-09 21:35:46,567 INFO L125 PetriNetUnfolderBase]: For 661/695 co-relation queries the response was YES. [2025-01-09 21:35:46,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 6906 events. 1200/6906 cut-off events. For 661/695 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 60384 event pairs, 985 based on Foata normal form. 836/6538 useless extension candidates. Maximal degree in co-relation 4715. Up to 2070 conditions per place. [2025-01-09 21:35:46,621 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 39 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-01-09 21:35:46,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 608 flow [2025-01-09 21:35:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-01-09 21:35:46,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493827160493828 [2025-01-09 21:35:46,623 INFO L175 Difference]: Start difference. First operand has 257 places, 270 transitions, 584 flow. Second operand 3 states and 688 transitions. [2025-01-09 21:35:46,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 608 flow [2025-01-09 21:35:46,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 241 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:35:46,626 INFO L231 Difference]: Finished difference. Result has 238 places, 241 transitions, 530 flow [2025-01-09 21:35:46,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=238, PETRI_TRANSITIONS=241} [2025-01-09 21:35:46,627 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -19 predicate places. [2025-01-09 21:35:46,627 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 241 transitions, 530 flow [2025-01-09 21:35:46,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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) [2025-01-09 21:35:46,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:46,627 INFO L206 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] [2025-01-09 21:35:46,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:35:46,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:46,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash 271326429, now seen corresponding path program 1 times [2025-01-09 21:35:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120300155] [2025-01-09 21:35:46,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:46,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:35:46,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:35:46,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:46,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:46,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:46,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120300155] [2025-01-09 21:35:46,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120300155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:46,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:46,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:46,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126937127] [2025-01-09 21:35:46,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:46,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:46,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:46,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:46,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 270 [2025-01-09 21:35:46,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 241 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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) [2025-01-09 21:35:46,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:46,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 270 [2025-01-09 21:35:46,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:47,435 INFO L124 PetriNetUnfolderBase]: 1650/7274 cut-off events. [2025-01-09 21:35:47,436 INFO L125 PetriNetUnfolderBase]: For 671/689 co-relation queries the response was YES. [2025-01-09 21:35:47,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10494 conditions, 7274 events. 1650/7274 cut-off events. For 671/689 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 60583 event pairs, 1169 based on Foata normal form. 0/6509 useless extension candidates. Maximal degree in co-relation 10463. Up to 2412 conditions per place. [2025-01-09 21:35:47,501 INFO L140 encePairwiseOnDemand]: 247/270 looper letters, 41 selfloop transitions, 11 changer transitions 0/233 dead transitions. [2025-01-09 21:35:47,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 618 flow [2025-01-09 21:35:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-01-09 21:35:47,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975308641975308 [2025-01-09 21:35:47,503 INFO L175 Difference]: Start difference. First operand has 238 places, 241 transitions, 530 flow. Second operand 3 states and 646 transitions. [2025-01-09 21:35:47,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 618 flow [2025-01-09 21:35:47,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 233 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:47,507 INFO L231 Difference]: Finished difference. Result has 226 places, 229 transitions, 524 flow [2025-01-09 21:35:47,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=226, PETRI_TRANSITIONS=229} [2025-01-09 21:35:47,507 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-01-09 21:35:47,507 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 229 transitions, 524 flow [2025-01-09 21:35:47,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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) [2025-01-09 21:35:47,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:47,508 INFO L206 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] [2025-01-09 21:35:47,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:35:47,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:47,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1833839527, now seen corresponding path program 1 times [2025-01-09 21:35:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:47,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237900314] [2025-01-09 21:35:47,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:47,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:35:47,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:35:47,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:47,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237900314] [2025-01-09 21:35:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237900314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:35:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474154867] [2025-01-09 21:35:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:47,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:47,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:47,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:47,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 270 [2025-01-09 21:35:47,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 229 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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) [2025-01-09 21:35:47,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:47,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 270 [2025-01-09 21:35:47,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:48,039 INFO L124 PetriNetUnfolderBase]: 630/4749 cut-off events. [2025-01-09 21:35:48,039 INFO L125 PetriNetUnfolderBase]: For 733/775 co-relation queries the response was YES. [2025-01-09 21:35:48,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 4749 events. 630/4749 cut-off events. For 733/775 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 39281 event pairs, 228 based on Foata normal form. 42/4287 useless extension candidates. Maximal degree in co-relation 4117. Up to 682 conditions per place. [2025-01-09 21:35:48,067 INFO L140 encePairwiseOnDemand]: 258/270 looper letters, 37 selfloop transitions, 8 changer transitions 0/245 dead transitions. [2025-01-09 21:35:48,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 245 transitions, 670 flow [2025-01-09 21:35:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-01-09 21:35:48,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8938271604938272 [2025-01-09 21:35:48,068 INFO L175 Difference]: Start difference. First operand has 226 places, 229 transitions, 524 flow. Second operand 3 states and 724 transitions. [2025-01-09 21:35:48,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 245 transitions, 670 flow [2025-01-09 21:35:48,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 245 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:48,073 INFO L231 Difference]: Finished difference. Result has 227 places, 233 transitions, 550 flow [2025-01-09 21:35:48,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=227, PETRI_TRANSITIONS=233} [2025-01-09 21:35:48,073 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2025-01-09 21:35:48,073 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 233 transitions, 550 flow [2025-01-09 21:35:48,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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) [2025-01-09 21:35:48,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:48,074 INFO L206 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] [2025-01-09 21:35:48,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:35:48,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2053563561, now seen corresponding path program 1 times [2025-01-09 21:35:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393300713] [2025-01-09 21:35:48,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:48,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:35:48,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:35:48,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:48,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:48,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:48,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393300713] [2025-01-09 21:35:48,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393300713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:48,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:48,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497681234] [2025-01-09 21:35:48,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:48,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:35:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:48,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:35:48,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:35:48,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 270 [2025-01-09 21:35:48,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 233 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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) [2025-01-09 21:35:48,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:48,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 270 [2025-01-09 21:35:48,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:49,097 INFO L124 PetriNetUnfolderBase]: 1558/7334 cut-off events. [2025-01-09 21:35:49,099 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-01-09 21:35:49,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10976 conditions, 7334 events. 1558/7334 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 61172 event pairs, 74 based on Foata normal form. 0/6826 useless extension candidates. Maximal degree in co-relation 4981. Up to 2728 conditions per place. [2025-01-09 21:35:49,140 INFO L140 encePairwiseOnDemand]: 264/270 looper letters, 62 selfloop transitions, 6 changer transitions 0/248 dead transitions. [2025-01-09 21:35:49,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 248 transitions, 716 flow [2025-01-09 21:35:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2025-01-09 21:35:49,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7993827160493827 [2025-01-09 21:35:49,143 INFO L175 Difference]: Start difference. First operand has 227 places, 233 transitions, 550 flow. Second operand 6 states and 1295 transitions. [2025-01-09 21:35:49,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 248 transitions, 716 flow [2025-01-09 21:35:49,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 248 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:49,147 INFO L231 Difference]: Finished difference. Result has 230 places, 232 transitions, 552 flow [2025-01-09 21:35:49,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2025-01-09 21:35:49,149 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -27 predicate places. [2025-01-09 21:35:49,149 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 552 flow [2025-01-09 21:35:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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) [2025-01-09 21:35:49,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:49,150 INFO L206 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] [2025-01-09 21:35:49,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:35:49,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:49,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 455107870, now seen corresponding path program 1 times [2025-01-09 21:35:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:49,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136105005] [2025-01-09 21:35:49,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:49,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:35:49,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:35:49,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:49,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:49,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136105005] [2025-01-09 21:35:49,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136105005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:49,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:49,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:49,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071248642] [2025-01-09 21:35:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:49,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:49,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:49,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:49,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:49,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-01-09 21:35:49,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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) [2025-01-09 21:35:49,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:49,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-01-09 21:35:49,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:49,892 INFO L124 PetriNetUnfolderBase]: 1177/6824 cut-off events. [2025-01-09 21:35:49,892 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2025-01-09 21:35:49,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 6824 events. 1177/6824 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 58437 event pairs, 990 based on Foata normal form. 0/6259 useless extension candidates. Maximal degree in co-relation 4313. Up to 2049 conditions per place. [2025-01-09 21:35:49,953 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2025-01-09 21:35:49,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 235 transitions, 648 flow [2025-01-09 21:35:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-01-09 21:35:49,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-01-09 21:35:49,955 INFO L175 Difference]: Start difference. First operand has 230 places, 232 transitions, 552 flow. Second operand 3 states and 682 transitions. [2025-01-09 21:35:49,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 235 transitions, 648 flow [2025-01-09 21:35:49,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 235 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:35:49,959 INFO L231 Difference]: Finished difference. Result has 226 places, 231 transitions, 542 flow [2025-01-09 21:35:49,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=226, PETRI_TRANSITIONS=231} [2025-01-09 21:35:49,960 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-01-09 21:35:49,960 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 231 transitions, 542 flow [2025-01-09 21:35:49,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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) [2025-01-09 21:35:49,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:49,960 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:49,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:35:49,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:49,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 849884849, now seen corresponding path program 1 times [2025-01-09 21:35:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098718445] [2025-01-09 21:35:49,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:49,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:35:49,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:35:49,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:49,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098718445] [2025-01-09 21:35:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098718445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:35:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056341599] [2025-01-09 21:35:50,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:50,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:35:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:50,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:35:50,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:35:50,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 270 [2025-01-09 21:35:50,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 231 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 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) [2025-01-09 21:35:50,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:50,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 270 [2025-01-09 21:35:50,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:50,701 INFO L124 PetriNetUnfolderBase]: 765/5100 cut-off events. [2025-01-09 21:35:50,701 INFO L125 PetriNetUnfolderBase]: For 948/986 co-relation queries the response was YES. [2025-01-09 21:35:50,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7086 conditions, 5100 events. 765/5100 cut-off events. For 948/986 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 42224 event pairs, 156 based on Foata normal form. 3/4608 useless extension candidates. Maximal degree in co-relation 5036. Up to 647 conditions per place. [2025-01-09 21:35:50,741 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 48 selfloop transitions, 15 changer transitions 0/255 dead transitions. [2025-01-09 21:35:50,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 255 transitions, 740 flow [2025-01-09 21:35:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:35:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:35:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2025-01-09 21:35:50,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8506172839506173 [2025-01-09 21:35:50,745 INFO L175 Difference]: Start difference. First operand has 226 places, 231 transitions, 542 flow. Second operand 6 states and 1378 transitions. [2025-01-09 21:35:50,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 255 transitions, 740 flow [2025-01-09 21:35:50,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 255 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:35:50,749 INFO L231 Difference]: Finished difference. Result has 233 places, 235 transitions, 614 flow [2025-01-09 21:35:50,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=233, PETRI_TRANSITIONS=235} [2025-01-09 21:35:50,749 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-01-09 21:35:50,750 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 235 transitions, 614 flow [2025-01-09 21:35:50,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 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) [2025-01-09 21:35:50,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:50,750 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-01-09 21:35:50,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:35:50,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:50,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 257748746, now seen corresponding path program 1 times [2025-01-09 21:35:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156945647] [2025-01-09 21:35:50,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:50,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:35:50,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:35:50,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:50,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:35:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156945647] [2025-01-09 21:35:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156945647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27115841] [2025-01-09 21:35:50,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:50,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:50,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:50,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:50,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-01-09 21:35:50,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 235 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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) [2025-01-09 21:35:50,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:50,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-01-09 21:35:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:51,391 INFO L124 PetriNetUnfolderBase]: 1105/6273 cut-off events. [2025-01-09 21:35:51,391 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-01-09 21:35:51,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 6273 events. 1105/6273 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 52669 event pairs, 944 based on Foata normal form. 0/5757 useless extension candidates. Maximal degree in co-relation 5170. Up to 1922 conditions per place. [2025-01-09 21:35:51,430 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-01-09 21:35:51,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 238 transitions, 710 flow [2025-01-09 21:35:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-01-09 21:35:51,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-01-09 21:35:51,432 INFO L175 Difference]: Start difference. First operand has 233 places, 235 transitions, 614 flow. Second operand 3 states and 682 transitions. [2025-01-09 21:35:51,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 238 transitions, 710 flow [2025-01-09 21:35:51,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 238 transitions, 696 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:51,439 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 602 flow [2025-01-09 21:35:51,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2025-01-09 21:35:51,439 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-01-09 21:35:51,439 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 602 flow [2025-01-09 21:35:51,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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) [2025-01-09 21:35:51,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:51,440 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 21:35:51,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:35:51,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:35:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash -357069397, now seen corresponding path program 1 times [2025-01-09 21:35:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349998705] [2025-01-09 21:35:51,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:51,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:35:51,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:35:51,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:51,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:51,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:35:51,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:35:51,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:35:51,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:51,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:35:51,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:35:51,487 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:35:51,487 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-01-09 21:35:51,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-01-09 21:35:51,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-01-09 21:35:51,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-01-09 21:35:51,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-01-09 21:35:51,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-01-09 21:35:51,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-01-09 21:35:51,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-01-09 21:35:51,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-01-09 21:35:51,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-01-09 21:35:51,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:35:51,491 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:51,492 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:35:51,492 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:35:51,517 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-09 21:35:51,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 323 transitions, 718 flow [2025-01-09 21:35:51,989 INFO L124 PetriNetUnfolderBase]: 544/5922 cut-off events. [2025-01-09 21:35:51,989 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-01-09 21:35:52,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 5922 events. 544/5922 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 46383 event pairs, 64 based on Foata normal form. 0/4701 useless extension candidates. Maximal degree in co-relation 3404. Up to 192 conditions per place. [2025-01-09 21:35:52,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 305 places, 323 transitions, 718 flow [2025-01-09 21:35:52,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 323 transitions, 718 flow [2025-01-09 21:35:52,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:35:52,075 INFO L333 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, 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;@335d2d11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:35:52,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:35:52,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:35:52,076 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:35:52,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:35:52,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:52,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:35:52,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:35:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -878471397, now seen corresponding path program 1 times [2025-01-09 21:35:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842653132] [2025-01-09 21:35:52,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:52,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:35:52,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:35:52,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:52,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842653132] [2025-01-09 21:35:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842653132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:52,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525454820] [2025-01-09 21:35:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:52,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:52,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:52,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:52,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:52,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2025-01-09 21:35:52,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 323 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2025-01-09 21:35:52,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:52,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2025-01-09 21:35:52,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:58,507 INFO L124 PetriNetUnfolderBase]: 12815/48824 cut-off events. [2025-01-09 21:35:58,508 INFO L125 PetriNetUnfolderBase]: For 7722/8268 co-relation queries the response was YES. [2025-01-09 21:35:58,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70847 conditions, 48824 events. 12815/48824 cut-off events. For 7722/8268 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 563897 event pairs, 10886 based on Foata normal form. 9883/50641 useless extension candidates. Maximal degree in co-relation 36613. Up to 19303 conditions per place. [2025-01-09 21:35:59,049 INFO L140 encePairwiseOnDemand]: 307/323 looper letters, 47 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-01-09 21:35:59,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 282 transitions, 734 flow [2025-01-09 21:35:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-01-09 21:35:59,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-01-09 21:35:59,051 INFO L175 Difference]: Start difference. First operand has 305 places, 323 transitions, 718 flow. Second operand 3 states and 816 transitions. [2025-01-09 21:35:59,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 282 transitions, 734 flow [2025-01-09 21:35:59,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 282 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:35:59,058 INFO L231 Difference]: Finished difference. Result has 276 places, 282 transitions, 640 flow [2025-01-09 21:35:59,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=276, PETRI_TRANSITIONS=282} [2025-01-09 21:35:59,058 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -29 predicate places. [2025-01-09 21:35:59,058 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 282 transitions, 640 flow [2025-01-09 21:35:59,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2025-01-09 21:35:59,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:35:59,059 INFO L206 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] [2025-01-09 21:35:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:35:59,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:35:59,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:35:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1304639298, now seen corresponding path program 1 times [2025-01-09 21:35:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:35:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643972707] [2025-01-09 21:35:59,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:35:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:35:59,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:35:59,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:35:59,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:35:59,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:35:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:35:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:35:59,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643972707] [2025-01-09 21:35:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643972707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:35:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:35:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:35:59,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68892183] [2025-01-09 21:35:59,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:35:59,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:35:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:35:59,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:35:59,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:35:59,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 323 [2025-01-09 21:35:59,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 282 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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) [2025-01-09 21:35:59,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:35:59,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 323 [2025-01-09 21:35:59,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:06,589 INFO L124 PetriNetUnfolderBase]: 17515/54343 cut-off events. [2025-01-09 21:36:06,589 INFO L125 PetriNetUnfolderBase]: For 7723/8171 co-relation queries the response was YES. [2025-01-09 21:36:06,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83910 conditions, 54343 events. 17515/54343 cut-off events. For 7723/8171 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 586519 event pairs, 12762 based on Foata normal form. 0/49193 useless extension candidates. Maximal degree in co-relation 83877. Up to 22195 conditions per place. [2025-01-09 21:36:07,210 INFO L140 encePairwiseOnDemand]: 300/323 looper letters, 51 selfloop transitions, 11 changer transitions 0/276 dead transitions. [2025-01-09 21:36:07,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 276 transitions, 752 flow [2025-01-09 21:36:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-01-09 21:36:07,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7977296181630547 [2025-01-09 21:36:07,212 INFO L175 Difference]: Start difference. First operand has 276 places, 282 transitions, 640 flow. Second operand 3 states and 773 transitions. [2025-01-09 21:36:07,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 276 transitions, 752 flow [2025-01-09 21:36:07,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 276 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:07,236 INFO L231 Difference]: Finished difference. Result has 264 places, 270 transitions, 634 flow [2025-01-09 21:36:07,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=264, PETRI_TRANSITIONS=270} [2025-01-09 21:36:07,237 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -41 predicate places. [2025-01-09 21:36:07,237 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 270 transitions, 634 flow [2025-01-09 21:36:07,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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) [2025-01-09 21:36:07,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:07,237 INFO L206 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] [2025-01-09 21:36:07,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:36:07,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:07,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:07,238 INFO L85 PathProgramCache]: Analyzing trace with hash 428387865, now seen corresponding path program 1 times [2025-01-09 21:36:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239735003] [2025-01-09 21:36:07,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:07,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:36:07,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:36:07,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:07,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:07,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239735003] [2025-01-09 21:36:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239735003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:07,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:07,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:36:07,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288038859] [2025-01-09 21:36:07,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:07,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:07,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:07,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:07,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 323 [2025-01-09 21:36:07,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 270 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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) [2025-01-09 21:36:07,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:07,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 323 [2025-01-09 21:36:07,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:12,133 INFO L124 PetriNetUnfolderBase]: 8365/37548 cut-off events. [2025-01-09 21:36:12,133 INFO L125 PetriNetUnfolderBase]: For 10422/10976 co-relation queries the response was YES. [2025-01-09 21:36:12,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55379 conditions, 37548 events. 8365/37548 cut-off events. For 10422/10976 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 454423 event pairs, 3344 based on Foata normal form. 300/33579 useless extension candidates. Maximal degree in co-relation 37016. Up to 8245 conditions per place. [2025-01-09 21:36:12,520 INFO L140 encePairwiseOnDemand]: 311/323 looper letters, 51 selfloop transitions, 8 changer transitions 0/292 dead transitions. [2025-01-09 21:36:12,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 292 transitions, 832 flow [2025-01-09 21:36:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:36:12,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2025-01-09 21:36:12,523 INFO L175 Difference]: Start difference. First operand has 264 places, 270 transitions, 634 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:36:12,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 292 transitions, 832 flow [2025-01-09 21:36:12,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 292 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:12,536 INFO L231 Difference]: Finished difference. Result has 265 places, 274 transitions, 660 flow [2025-01-09 21:36:12,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=265, PETRI_TRANSITIONS=274} [2025-01-09 21:36:12,536 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -40 predicate places. [2025-01-09 21:36:12,536 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 274 transitions, 660 flow [2025-01-09 21:36:12,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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) [2025-01-09 21:36:12,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:12,537 INFO L206 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] [2025-01-09 21:36:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:36:12,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:12,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash 158449610, now seen corresponding path program 1 times [2025-01-09 21:36:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377192911] [2025-01-09 21:36:12,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:12,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:36:12,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:36:12,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:12,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:12,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377192911] [2025-01-09 21:36:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377192911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:12,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:12,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:12,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381226483] [2025-01-09 21:36:12,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:12,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:12,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:12,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:12,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 323 [2025-01-09 21:36:12,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 274 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 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) [2025-01-09 21:36:12,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:12,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 323 [2025-01-09 21:36:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand