./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --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/weaver/popl20-more-mts.wvr.c -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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:34,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:34,526 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:33:34,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:34,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:34,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:34,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:34,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:34,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:34,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:34,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:34,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:34,555 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:34,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:34,556 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:34,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:34,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:34,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:34,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:34,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:34,558 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2025-01-09 21:33:34,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:34,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:34,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:34,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:34,796 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:34,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-01-09 21:33:35,974 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14984ffc9/9b2068ea875c484989ee5c736893e88c/FLAGed034ef71 [2025-01-09 21:33:36,205 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:36,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-01-09 21:33:36,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14984ffc9/9b2068ea875c484989ee5c736893e88c/FLAGed034ef71 [2025-01-09 21:33:36,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14984ffc9/9b2068ea875c484989ee5c736893e88c [2025-01-09 21:33:36,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:36,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:36,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:36,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:36,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:36,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58691968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36, skipping insertion in model container [2025-01-09 21:33:36,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:36,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:36,390 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:36,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:36,423 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:36,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36 WrapperNode [2025-01-09 21:33:36,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:36,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:36,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:36,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:36,429 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:33:36" (1/1) ... [2025-01-09 21:33:36,436 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:33:36" (1/1) ... [2025-01-09 21:33:36,467 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 348 [2025-01-09 21:33:36,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:36,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:36,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:36,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:36,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:36,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:36,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:36,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:36,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (1/1) ... [2025-01-09 21:33:36,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:36,538 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:33:36,542 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:33:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:36,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:36,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:36,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:36,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:36,560 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:33:36,633 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:36,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:37,093 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:37,093 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:37,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:37,361 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:37,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:37 BoogieIcfgContainer [2025-01-09 21:33:37,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:37,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:37,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:37,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:37,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:36" (1/3) ... [2025-01-09 21:33:37,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d69c1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:37, skipping insertion in model container [2025-01-09 21:33:37,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:36" (2/3) ... [2025-01-09 21:33:37,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d69c1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:37, skipping insertion in model container [2025-01-09 21:33:37,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:37" (3/3) ... [2025-01-09 21:33:37,369 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-01-09 21:33:37,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:37,384 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 351 locations, 1 initial locations, 4 loop locations, and 44 error locations. [2025-01-09 21:33:37,384 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:37,485 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:37,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 360 places, 369 transitions, 759 flow [2025-01-09 21:33:37,659 INFO L124 PetriNetUnfolderBase]: 19/366 cut-off events. [2025-01-09 21:33:37,662 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:37,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 366 events. 19/366 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 867 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 293. Up to 2 conditions per place. [2025-01-09 21:33:37,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 360 places, 369 transitions, 759 flow [2025-01-09 21:33:37,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 345 transitions, 708 flow [2025-01-09 21:33:37,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:37,698 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;@16b9a742, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:37,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2025-01-09 21:33:37,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:37,708 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:33:37,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:37,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:37,709 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] [2025-01-09 21:33:37,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:37,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1789210599, now seen corresponding path program 1 times [2025-01-09 21:33:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:37,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716097601] [2025-01-09 21:33:37,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:37,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:33:37,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:33:37,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:37,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:37,854 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:33:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:37,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716097601] [2025-01-09 21:33:37,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716097601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:37,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:37,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846259897] [2025-01-09 21:33:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:37,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:37,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:37,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:37,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 369 [2025-01-09 21:33:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 345 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:33:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:37,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 369 [2025-01-09 21:33:37,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:38,096 INFO L124 PetriNetUnfolderBase]: 32/689 cut-off events. [2025-01-09 21:33:38,096 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:33:38,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 689 events. 32/689 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3102 event pairs, 12 based on Foata normal form. 29/611 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2025-01-09 21:33:38,105 INFO L140 encePairwiseOnDemand]: 345/369 looper letters, 14 selfloop transitions, 2 changer transitions 3/323 dead transitions. [2025-01-09 21:33:38,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 323 transitions, 696 flow [2025-01-09 21:33:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1022 transitions. [2025-01-09 21:33:38,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9232158988256549 [2025-01-09 21:33:38,119 INFO L175 Difference]: Start difference. First operand has 338 places, 345 transitions, 708 flow. Second operand 3 states and 1022 transitions. [2025-01-09 21:33:38,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 323 transitions, 696 flow [2025-01-09 21:33:38,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 323 transitions, 684 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:38,132 INFO L231 Difference]: Finished difference. Result has 322 places, 320 transitions, 650 flow [2025-01-09 21:33:38,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=322, PETRI_TRANSITIONS=320} [2025-01-09 21:33:38,136 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -16 predicate places. [2025-01-09 21:33:38,136 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 320 transitions, 650 flow [2025-01-09 21:33:38,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:33:38,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:38,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, 1, 1, 1, 1] [2025-01-09 21:33:38,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:38,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 470130210, now seen corresponding path program 1 times [2025-01-09 21:33:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348194247] [2025-01-09 21:33:38,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:38,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:33:38,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:33:38,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:38,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:38,182 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:33:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348194247] [2025-01-09 21:33:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348194247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897809969] [2025-01-09 21:33:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:38,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:38,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:38,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:38,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 369 [2025-01-09 21:33:38,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 320 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:33:38,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:38,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 369 [2025-01-09 21:33:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:38,289 INFO L124 PetriNetUnfolderBase]: 23/635 cut-off events. [2025-01-09 21:33:38,289 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:38,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 635 events. 23/635 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2761 event pairs, 8 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 649. Up to 35 conditions per place. [2025-01-09 21:33:38,297 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 14 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-01-09 21:33:38,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 319 transitions, 680 flow [2025-01-09 21:33:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2025-01-09 21:33:38,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042457091237579 [2025-01-09 21:33:38,303 INFO L175 Difference]: Start difference. First operand has 322 places, 320 transitions, 650 flow. Second operand 3 states and 1001 transitions. [2025-01-09 21:33:38,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 319 transitions, 680 flow [2025-01-09 21:33:38,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:38,308 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 648 flow [2025-01-09 21:33:38,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2025-01-09 21:33:38,309 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2025-01-09 21:33:38,309 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 648 flow [2025-01-09 21:33:38,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:33:38,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:38,311 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] [2025-01-09 21:33:38,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:38,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:38,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1202238215, now seen corresponding path program 1 times [2025-01-09 21:33:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-01-09 21:33:38,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:38,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:33:38,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:33:38,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:38,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:38,365 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:33:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-01-09 21:33:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072159083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54815909] [2025-01-09 21:33:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:38,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:38,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-01-09 21:33:38,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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:33:38,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:38,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-01-09 21:33:38,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:38,490 INFO L124 PetriNetUnfolderBase]: 35/596 cut-off events. [2025-01-09 21:33:38,491 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:33:38,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 596 events. 35/596 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2516 event pairs, 16 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 625. Up to 56 conditions per place. [2025-01-09 21:33:38,497 INFO L140 encePairwiseOnDemand]: 364/369 looper letters, 15 selfloop transitions, 1 changer transitions 0/315 dead transitions. [2025-01-09 21:33:38,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 672 flow [2025-01-09 21:33:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2025-01-09 21:33:38,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015356820234869 [2025-01-09 21:33:38,502 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 648 flow. Second operand 3 states and 998 transitions. [2025-01-09 21:33:38,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 672 flow [2025-01-09 21:33:38,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:38,506 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 638 flow [2025-01-09 21:33:38,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2025-01-09 21:33:38,507 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -24 predicate places. [2025-01-09 21:33:38,508 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 638 flow [2025-01-09 21:33:38,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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:33:38,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:38,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:38,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash 179022397, now seen corresponding path program 1 times [2025-01-09 21:33:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839204357] [2025-01-09 21:33:38,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:38,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:33:38,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:33:38,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:38,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:38,591 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:33:38,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:38,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839204357] [2025-01-09 21:33:38,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839204357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:38,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:38,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862053] [2025-01-09 21:33:38,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:38,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:38,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:38,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:38,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 369 [2025-01-09 21:33:38,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:33:38,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:38,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 369 [2025-01-09 21:33:38,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:38,717 INFO L124 PetriNetUnfolderBase]: 57/676 cut-off events. [2025-01-09 21:33:38,717 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:33:38,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 676 events. 57/676 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3251 event pairs, 38 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 735. Up to 81 conditions per place. [2025-01-09 21:33:38,721 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 14 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2025-01-09 21:33:38,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 668 flow [2025-01-09 21:33:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2025-01-09 21:33:38,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042457091237579 [2025-01-09 21:33:38,724 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 638 flow. Second operand 3 states and 1001 transitions. [2025-01-09 21:33:38,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 314 transitions, 668 flow [2025-01-09 21:33:38,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:38,729 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 639 flow [2025-01-09 21:33:38,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2025-01-09 21:33:38,729 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -24 predicate places. [2025-01-09 21:33:38,730 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 639 flow [2025-01-09 21:33:38,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:33:38,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:38,730 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, 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:33:38,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:38,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:38,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1442434382, now seen corresponding path program 1 times [2025-01-09 21:33:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:38,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-01-09 21:33:38,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:38,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:38,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:33:38,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:33:38,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:38,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:39,254 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:33:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:39,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-01-09 21:33:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717929570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:39,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208413647] [2025-01-09 21:33:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:39,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:39,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:39,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:39,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 369 [2025-01-09 21:33:39,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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:33:39,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:39,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 369 [2025-01-09 21:33:39,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:39,824 INFO L124 PetriNetUnfolderBase]: 540/3433 cut-off events. [2025-01-09 21:33:39,824 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-09 21:33:39,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4320 conditions, 3433 events. 540/3433 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 28343 event pairs, 386 based on Foata normal form. 0/2873 useless extension candidates. Maximal degree in co-relation 4281. Up to 786 conditions per place. [2025-01-09 21:33:39,845 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 31 selfloop transitions, 5 changer transitions 0/313 dead transitions. [2025-01-09 21:33:39,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 709 flow [2025-01-09 21:33:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1891 transitions. [2025-01-09 21:33:39,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541102077687444 [2025-01-09 21:33:39,851 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 639 flow. Second operand 6 states and 1891 transitions. [2025-01-09 21:33:39,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 709 flow [2025-01-09 21:33:39,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 313 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:39,855 INFO L231 Difference]: Finished difference. Result has 316 places, 313 transitions, 643 flow [2025-01-09 21:33:39,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=643, PETRI_PLACES=316, PETRI_TRANSITIONS=313} [2025-01-09 21:33:39,856 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -22 predicate places. [2025-01-09 21:33:39,856 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 313 transitions, 643 flow [2025-01-09 21:33:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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:33:39,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:39,859 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, 1, 1, 1, 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:33:39,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:39,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:39,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash 503486007, now seen corresponding path program 1 times [2025-01-09 21:33:39,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:39,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555160729] [2025-01-09 21:33:39,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:39,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:33:39,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:33:39,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:39,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:39,891 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:33:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:39,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555160729] [2025-01-09 21:33:39,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555160729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:39,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927121157] [2025-01-09 21:33:39,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:39,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:39,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:39,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:39,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:39,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-01-09 21:33:39,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 313 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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:33:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-01-09 21:33:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:39,970 INFO L124 PetriNetUnfolderBase]: 52/649 cut-off events. [2025-01-09 21:33:39,970 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:33:39,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 649 events. 52/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2886 event pairs, 28 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 719. Up to 73 conditions per place. [2025-01-09 21:33:39,976 INFO L140 encePairwiseOnDemand]: 364/369 looper letters, 15 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2025-01-09 21:33:39,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 667 flow [2025-01-09 21:33:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2025-01-09 21:33:39,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015356820234869 [2025-01-09 21:33:39,978 INFO L175 Difference]: Start difference. First operand has 316 places, 313 transitions, 643 flow. Second operand 3 states and 998 transitions. [2025-01-09 21:33:39,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 667 flow [2025-01-09 21:33:39,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 309 transitions, 657 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:39,981 INFO L231 Difference]: Finished difference. Result has 309 places, 309 transitions, 627 flow [2025-01-09 21:33:39,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=309, PETRI_TRANSITIONS=309} [2025-01-09 21:33:39,984 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2025-01-09 21:33:39,984 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 309 transitions, 627 flow [2025-01-09 21:33:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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:33:39,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:39,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:39,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:39,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash -63468420, now seen corresponding path program 1 times [2025-01-09 21:33:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:39,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557025848] [2025-01-09 21:33:39,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:39,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:33:39,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:33:39,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:39,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:40,015 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:33:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:40,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557025848] [2025-01-09 21:33:40,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557025848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308431626] [2025-01-09 21:33:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:40,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:40,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:40,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:40,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 369 [2025-01-09 21:33:40,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 309 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 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:33:40,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:40,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 369 [2025-01-09 21:33:40,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:40,092 INFO L124 PetriNetUnfolderBase]: 32/546 cut-off events. [2025-01-09 21:33:40,093 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:40,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 546 events. 32/546 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2192 event pairs, 5 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 578. Up to 33 conditions per place. [2025-01-09 21:33:40,098 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 14 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2025-01-09 21:33:40,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 663 flow [2025-01-09 21:33:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2025-01-09 21:33:40,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9096657633242999 [2025-01-09 21:33:40,100 INFO L175 Difference]: Start difference. First operand has 309 places, 309 transitions, 627 flow. Second operand 3 states and 1007 transitions. [2025-01-09 21:33:40,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 663 flow [2025-01-09 21:33:40,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:40,104 INFO L231 Difference]: Finished difference. Result has 307 places, 306 transitions, 626 flow [2025-01-09 21:33:40,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=307, PETRI_TRANSITIONS=306} [2025-01-09 21:33:40,105 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -31 predicate places. [2025-01-09 21:33:40,105 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 306 transitions, 626 flow [2025-01-09 21:33:40,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 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:33:40,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:40,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:40,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:40,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:40,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash -863572706, now seen corresponding path program 1 times [2025-01-09 21:33:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681250689] [2025-01-09 21:33:40,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:40,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:33:40,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:33:40,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:40,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:40,131 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:33:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681250689] [2025-01-09 21:33:40,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681250689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:40,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:40,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:40,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664262789] [2025-01-09 21:33:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:40,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:40,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:40,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:40,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-01-09 21:33:40,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 306 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:33:40,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:40,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-01-09 21:33:40,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:40,352 INFO L124 PetriNetUnfolderBase]: 236/2175 cut-off events. [2025-01-09 21:33:40,352 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 21:33:40,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 2175 events. 236/2175 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 15653 event pairs, 61 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 2513. Up to 305 conditions per place. [2025-01-09 21:33:40,372 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 21 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2025-01-09 21:33:40,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 310 transitions, 687 flow [2025-01-09 21:33:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2025-01-09 21:33:40,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087624209575429 [2025-01-09 21:33:40,375 INFO L175 Difference]: Start difference. First operand has 307 places, 306 transitions, 626 flow. Second operand 3 states and 1006 transitions. [2025-01-09 21:33:40,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 310 transitions, 687 flow [2025-01-09 21:33:40,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 310 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:40,382 INFO L231 Difference]: Finished difference. Result has 304 places, 305 transitions, 633 flow [2025-01-09 21:33:40,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=304, PETRI_TRANSITIONS=305} [2025-01-09 21:33:40,384 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -34 predicate places. [2025-01-09 21:33:40,384 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 305 transitions, 633 flow [2025-01-09 21:33:40,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:33:40,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:40,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:40,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:40,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1379663895, now seen corresponding path program 1 times [2025-01-09 21:33:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430810940] [2025-01-09 21:33:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:40,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:33:40,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:33:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:40,425 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:33:40,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:40,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430810940] [2025-01-09 21:33:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430810940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839479153] [2025-01-09 21:33:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:40,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:40,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:40,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-01-09 21:33:40,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 305 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:33:40,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:40,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-01-09 21:33:40,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:40,544 INFO L124 PetriNetUnfolderBase]: 122/862 cut-off events. [2025-01-09 21:33:40,545 INFO L125 PetriNetUnfolderBase]: For 78/85 co-relation queries the response was YES. [2025-01-09 21:33:40,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 862 events. 122/862 cut-off events. For 78/85 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4595 event pairs, 11 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1090. Up to 117 conditions per place. [2025-01-09 21:33:40,552 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 18 selfloop transitions, 3 changer transitions 0/305 dead transitions. [2025-01-09 21:33:40,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 305 transitions, 682 flow [2025-01-09 21:33:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2025-01-09 21:33:40,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042457091237579 [2025-01-09 21:33:40,554 INFO L175 Difference]: Start difference. First operand has 304 places, 305 transitions, 633 flow. Second operand 3 states and 1001 transitions. [2025-01-09 21:33:40,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 305 transitions, 682 flow [2025-01-09 21:33:40,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 305 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:40,558 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 631 flow [2025-01-09 21:33:40,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2025-01-09 21:33:40,559 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -36 predicate places. [2025-01-09 21:33:40,559 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 631 flow [2025-01-09 21:33:40,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:33:40,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:40,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:40,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:40,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:40,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash 390126242, now seen corresponding path program 1 times [2025-01-09 21:33:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713083596] [2025-01-09 21:33:40,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:40,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:33:40,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:33:40,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:40,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:40,671 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:33:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713083596] [2025-01-09 21:33:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713083596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:40,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:40,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:33:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537309244] [2025-01-09 21:33:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:40,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:33:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:40,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:33:40,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:33:40,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 369 [2025-01-09 21:33:40,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 631 flow. Second operand has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 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:33:40,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:40,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 369 [2025-01-09 21:33:40,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:41,095 INFO L124 PetriNetUnfolderBase]: 115/1253 cut-off events. [2025-01-09 21:33:41,095 INFO L125 PetriNetUnfolderBase]: For 68/108 co-relation queries the response was YES. [2025-01-09 21:33:41,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 1253 events. 115/1253 cut-off events. For 68/108 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7420 event pairs, 30 based on Foata normal form. 6/1142 useless extension candidates. Maximal degree in co-relation 1527. Up to 106 conditions per place. [2025-01-09 21:33:41,109 INFO L140 encePairwiseOnDemand]: 356/369 looper letters, 28 selfloop transitions, 14 changer transitions 0/320 dead transitions. [2025-01-09 21:33:41,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 320 transitions, 771 flow [2025-01-09 21:33:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:33:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:33:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3280 transitions. [2025-01-09 21:33:41,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-01-09 21:33:41,116 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 631 flow. Second operand 10 states and 3280 transitions. [2025-01-09 21:33:41,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 320 transitions, 771 flow [2025-01-09 21:33:41,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 320 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:41,121 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 691 flow [2025-01-09 21:33:41,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=691, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2025-01-09 21:33:41,122 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -25 predicate places. [2025-01-09 21:33:41,122 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 691 flow [2025-01-09 21:33:41,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 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:33:41,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:41,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:41,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:41,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:41,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash 938650429, now seen corresponding path program 1 times [2025-01-09 21:33:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546955124] [2025-01-09 21:33:41,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:41,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:33:41,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:33:41,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:41,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:41,223 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:33:41,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:41,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546955124] [2025-01-09 21:33:41,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546955124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:41,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:41,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879119106] [2025-01-09 21:33:41,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:41,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:33:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:41,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:33:41,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:33:41,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-01-09 21:33:41,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 691 flow. Second operand has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 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:33:41,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:41,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-01-09 21:33:41,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:41,474 INFO L124 PetriNetUnfolderBase]: 222/1940 cut-off events. [2025-01-09 21:33:41,475 INFO L125 PetriNetUnfolderBase]: For 191/200 co-relation queries the response was YES. [2025-01-09 21:33:41,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1940 events. 222/1940 cut-off events. For 191/200 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13176 event pairs, 75 based on Foata normal form. 12/1773 useless extension candidates. Maximal degree in co-relation 2499. Up to 218 conditions per place. [2025-01-09 21:33:41,490 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 30 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-01-09 21:33:41,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 323 transitions, 809 flow [2025-01-09 21:33:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:33:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:33:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1663 transitions. [2025-01-09 21:33:41,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9013550135501355 [2025-01-09 21:33:41,493 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 691 flow. Second operand 5 states and 1663 transitions. [2025-01-09 21:33:41,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 323 transitions, 809 flow [2025-01-09 21:33:41,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 323 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:41,497 INFO L231 Difference]: Finished difference. Result has 318 places, 310 transitions, 712 flow [2025-01-09 21:33:41,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=318, PETRI_TRANSITIONS=310} [2025-01-09 21:33:41,499 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2025-01-09 21:33:41,499 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 310 transitions, 712 flow [2025-01-09 21:33:41,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 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:33:41,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:41,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:41,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:41,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:41,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1029554755, now seen corresponding path program 1 times [2025-01-09 21:33:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751033274] [2025-01-09 21:33:41,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:41,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 21:33:41,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 21:33:41,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:41,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:41,777 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:33:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751033274] [2025-01-09 21:33:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751033274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:41,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:41,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973810644] [2025-01-09 21:33:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:41,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:41,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:41,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:41,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 369 [2025-01-09 21:33:41,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 310 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 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:33:41,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:41,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 369 [2025-01-09 21:33:41,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:42,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1290] L63-6-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork0_~i~2#1_15| 4))) (let ((.cse2 (+ v_~A~0.offset_222 .cse13))) (let ((.cse4 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse2))) (let ((.cse11 (+ v_~mts3~0_159 .cse4))) (let ((.cse5 (select |v_#race_453| v_~A~0.base_222)) (.cse1 (+ v_~A~0.offset_222 .cse13 2)) (.cse9 (+ v_~A~0.offset_222 .cse13 3)) (.cse3 (<= 0 (+ v_~mts3~0_159 2147483648 .cse4))) (.cse0 (select |v_#race_441| v_~A~0.base_222)) (.cse6 (+ v_~A~0.offset_222 .cse13 1)) (.cse12 (<= .cse11 2147483647))) (and (= (select .cse0 .cse1) 0) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse2) 0) .cse3 (= (+ v_~sum~0_94 .cse4) |v_thread3Thread1of1ForFork0_plus_#res#1_17|) (let ((.cse7 (= |v_#race~A~0_277| 0)) (.cse8 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse2 0) .cse6 0) .cse1 0) .cse9 0)))) (.cse10 (= |v_#race~mts3~0_254| 0))) (or (and (= (select .cse5 .cse6) 0) .cse7 .cse8 (= (select .cse5 .cse2) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) (= (select .cse5 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse4) .cse10 (= (select .cse5 .cse1) 0) (<= 0 .cse11)) (and .cse7 (= v_~mts3~0_158 0) .cse8 (< .cse11 0) (= |v_thread3_#t~mem15#1_180| |v_thread3Thread1of1ForFork0_#t~mem15#1_13|) .cse10))) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse5 .cse2 0) .cse6 0) .cse1 0) .cse9 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_17| v_~sum~0_94) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_17| 2147483647)) 1 0) 0)) (<= v_~sum~0_93 2147483647) (= (select .cse0 .cse9) 0) (not (= (ite (or (<= v_~sum~0_94 |v_thread3Thread1of1ForFork0_plus_#res#1_17|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_17| 2147483648))) 1 0) 0)) (not (= (ite (or .cse3 (<= 0 .cse4)) 1 0) 0)) .cse12 (= (select .cse0 .cse6) 0) (= v_~sum~0_93 |v_thread3Thread1of1ForFork0_plus_#res#1_17|) (not (= (ite (or (<= .cse4 0) .cse12) 1 0) 0)) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork0_#t~mem15#1=|v_thread3Thread1of1ForFork0_#t~mem15#1_13|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_15|} OutVars{#race=|v_#race_441|, ~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_17|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_15|, thread3Thread1of1ForFork0_#t~ite16#1=|v_thread3Thread1of1ForFork0_#t~ite16#1_11|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork0_#t~nondet17#1=|v_thread3Thread1of1ForFork0_#t~nondet17#1_11|, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_17|, thread3Thread1of1ForFork0_#t~ret19#1=|v_thread3Thread1of1ForFork0_#t~ret19#1_3|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_17|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork0_#t~mem18#1=|v_thread3Thread1of1ForFork0_#t~mem18#1_5|, #race~sum~0=|v_#race~sum~0_123|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_17|, thread3Thread1of1ForFork0_#t~nondet20#1=|v_thread3Thread1of1ForFork0_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_#t~mem15#1, thread3Thread1of1ForFork0_#t~ite16#1, thread3Thread1of1ForFork0_#t~mem13#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_#t~nondet17#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_#t~ret19#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~nondet20#1, #race~A~0][178], [289#L48-2true, Black: 418#(<= (+ ~M~0 1) 0), Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 387#true, 210#L86-4true, 383#(= |#race~M~0| 0), 422#true, 69#L67true, 389#(= |#race~A~0| 0), 13#L59true, Black: 406#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 371#(= |#race~N~0| 0), 415#true, Black: 400#(and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 404#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 399#(<= ~N~0 0)]) [2025-01-09 21:33:42,251 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:33:42,251 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:33:42,251 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:33:42,251 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:33:42,293 INFO L124 PetriNetUnfolderBase]: 406/2433 cut-off events. [2025-01-09 21:33:42,293 INFO L125 PetriNetUnfolderBase]: For 450/464 co-relation queries the response was YES. [2025-01-09 21:33:42,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 2433 events. 406/2433 cut-off events. For 450/464 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 18221 event pairs, 71 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 3468. Up to 281 conditions per place. [2025-01-09 21:33:42,313 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 36 selfloop transitions, 5 changer transitions 0/320 dead transitions. [2025-01-09 21:33:42,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 830 flow [2025-01-09 21:33:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2025-01-09 21:33:42,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798554652213189 [2025-01-09 21:33:42,317 INFO L175 Difference]: Start difference. First operand has 318 places, 310 transitions, 712 flow. Second operand 6 states and 1948 transitions. [2025-01-09 21:33:42,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 830 flow [2025-01-09 21:33:42,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:42,321 INFO L231 Difference]: Finished difference. Result has 319 places, 308 transitions, 713 flow [2025-01-09 21:33:42,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=319, PETRI_TRANSITIONS=308} [2025-01-09 21:33:42,322 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -19 predicate places. [2025-01-09 21:33:42,322 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 308 transitions, 713 flow [2025-01-09 21:33:42,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 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:33:42,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:42,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:42,323 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:42,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -277025109, now seen corresponding path program 1 times [2025-01-09 21:33:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282428003] [2025-01-09 21:33:42,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:42,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:33:42,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:33:42,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:42,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282428003] [2025-01-09 21:33:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282428003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007081742] [2025-01-09 21:33:42,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:42,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:42,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:42,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:42,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 369 [2025-01-09 21:33:42,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 308 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 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:33:42,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:42,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 369 [2025-01-09 21:33:42,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,050 INFO L124 PetriNetUnfolderBase]: 251/1801 cut-off events. [2025-01-09 21:33:43,050 INFO L125 PetriNetUnfolderBase]: For 239/319 co-relation queries the response was YES. [2025-01-09 21:33:43,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1801 events. 251/1801 cut-off events. For 239/319 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12914 event pairs, 50 based on Foata normal form. 4/1680 useless extension candidates. Maximal degree in co-relation 2617. Up to 221 conditions per place. [2025-01-09 21:33:43,065 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 36 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2025-01-09 21:33:43,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 318 transitions, 831 flow [2025-01-09 21:33:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2025-01-09 21:33:43,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798554652213189 [2025-01-09 21:33:43,068 INFO L175 Difference]: Start difference. First operand has 319 places, 308 transitions, 713 flow. Second operand 6 states and 1948 transitions. [2025-01-09 21:33:43,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 318 transitions, 831 flow [2025-01-09 21:33:43,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 821 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:43,075 INFO L231 Difference]: Finished difference. Result has 317 places, 306 transitions, 709 flow [2025-01-09 21:33:43,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=317, PETRI_TRANSITIONS=306} [2025-01-09 21:33:43,077 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -21 predicate places. [2025-01-09 21:33:43,078 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 306 transitions, 709 flow [2025-01-09 21:33:43,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 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:33:43,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:43,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:43,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1740921625, now seen corresponding path program 1 times [2025-01-09 21:33:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691313729] [2025-01-09 21:33:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:33:43,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:33:43,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,124 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:33:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691313729] [2025-01-09 21:33:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691313729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964588489] [2025-01-09 21:33:43,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 369 [2025-01-09 21:33:43,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 306 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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:33:43,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 369 [2025-01-09 21:33:43,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,232 INFO L124 PetriNetUnfolderBase]: 73/1183 cut-off events. [2025-01-09 21:33:43,233 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2025-01-09 21:33:43,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1183 events. 73/1183 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6783 event pairs, 11 based on Foata normal form. 8/1126 useless extension candidates. Maximal degree in co-relation 1459. Up to 99 conditions per place. [2025-01-09 21:33:43,240 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 9 selfloop transitions, 1 changer transitions 2/304 dead transitions. [2025-01-09 21:33:43,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 304 transitions, 727 flow [2025-01-09 21:33:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2025-01-09 21:33:43,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9132791327913279 [2025-01-09 21:33:43,242 INFO L175 Difference]: Start difference. First operand has 317 places, 306 transitions, 709 flow. Second operand 3 states and 1011 transitions. [2025-01-09 21:33:43,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 304 transitions, 727 flow [2025-01-09 21:33:43,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:43,245 INFO L231 Difference]: Finished difference. Result has 312 places, 302 transitions, 693 flow [2025-01-09 21:33:43,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=312, PETRI_TRANSITIONS=302} [2025-01-09 21:33:43,246 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -26 predicate places. [2025-01-09 21:33:43,246 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 302 transitions, 693 flow [2025-01-09 21:33:43,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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:33:43,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:43,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:43,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 837031336, now seen corresponding path program 1 times [2025-01-09 21:33:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020043284] [2025-01-09 21:33:43,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:33:43,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:33:43,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,276 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:33:43,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020043284] [2025-01-09 21:33:43,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020043284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296084512] [2025-01-09 21:33:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 369 [2025-01-09 21:33:43,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 302 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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:33:43,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 369 [2025-01-09 21:33:43,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,400 INFO L124 PetriNetUnfolderBase]: 73/1151 cut-off events. [2025-01-09 21:33:43,401 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2025-01-09 21:33:43,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1151 events. 73/1151 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6489 event pairs, 11 based on Foata normal form. 8/1110 useless extension candidates. Maximal degree in co-relation 1405. Up to 99 conditions per place. [2025-01-09 21:33:43,412 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 6 selfloop transitions, 0 changer transitions 14/300 dead transitions. [2025-01-09 21:33:43,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 300 transitions, 711 flow [2025-01-09 21:33:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2025-01-09 21:33:43,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9132791327913279 [2025-01-09 21:33:43,415 INFO L175 Difference]: Start difference. First operand has 312 places, 302 transitions, 693 flow. Second operand 3 states and 1011 transitions. [2025-01-09 21:33:43,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 300 transitions, 711 flow [2025-01-09 21:33:43,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 300 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:43,420 INFO L231 Difference]: Finished difference. Result has 309 places, 286 transitions, 657 flow [2025-01-09 21:33:43,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=309, PETRI_TRANSITIONS=286} [2025-01-09 21:33:43,421 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2025-01-09 21:33:43,421 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 286 transitions, 657 flow [2025-01-09 21:33:43,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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:33:43,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:43,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:43,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1923211321, now seen corresponding path program 1 times [2025-01-09 21:33:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-01-09 21:33:43,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 21:33:43,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 21:33:43,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:33:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-01-09 21:33:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396012816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544977398] [2025-01-09 21:33:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 369 [2025-01-09 21:33:43,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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:33:43,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 369 [2025-01-09 21:33:43,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1290] L63-6-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork0_~i~2#1_15| 4))) (let ((.cse2 (+ v_~A~0.offset_222 .cse13))) (let ((.cse4 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse2))) (let ((.cse11 (+ v_~mts3~0_159 .cse4))) (let ((.cse5 (select |v_#race_453| v_~A~0.base_222)) (.cse1 (+ v_~A~0.offset_222 .cse13 2)) (.cse9 (+ v_~A~0.offset_222 .cse13 3)) (.cse3 (<= 0 (+ v_~mts3~0_159 2147483648 .cse4))) (.cse0 (select |v_#race_441| v_~A~0.base_222)) (.cse6 (+ v_~A~0.offset_222 .cse13 1)) (.cse12 (<= .cse11 2147483647))) (and (= (select .cse0 .cse1) 0) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse2) 0) .cse3 (= (+ v_~sum~0_94 .cse4) |v_thread3Thread1of1ForFork0_plus_#res#1_17|) (let ((.cse7 (= |v_#race~A~0_277| 0)) (.cse8 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse2 0) .cse6 0) .cse1 0) .cse9 0)))) (.cse10 (= |v_#race~mts3~0_254| 0))) (or (and (= (select .cse5 .cse6) 0) .cse7 .cse8 (= (select .cse5 .cse2) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) (= (select .cse5 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse4) .cse10 (= (select .cse5 .cse1) 0) (<= 0 .cse11)) (and .cse7 (= v_~mts3~0_158 0) .cse8 (< .cse11 0) (= |v_thread3_#t~mem15#1_180| |v_thread3Thread1of1ForFork0_#t~mem15#1_13|) .cse10))) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse5 .cse2 0) .cse6 0) .cse1 0) .cse9 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_17| v_~sum~0_94) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_17| 2147483647)) 1 0) 0)) (<= v_~sum~0_93 2147483647) (= (select .cse0 .cse9) 0) (not (= (ite (or (<= v_~sum~0_94 |v_thread3Thread1of1ForFork0_plus_#res#1_17|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_17| 2147483648))) 1 0) 0)) (not (= (ite (or .cse3 (<= 0 .cse4)) 1 0) 0)) .cse12 (= (select .cse0 .cse6) 0) (= v_~sum~0_93 |v_thread3Thread1of1ForFork0_plus_#res#1_17|) (not (= (ite (or (<= .cse4 0) .cse12) 1 0) 0)) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork0_#t~mem15#1=|v_thread3Thread1of1ForFork0_#t~mem15#1_13|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_15|} OutVars{#race=|v_#race_441|, ~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_17|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_15|, thread3Thread1of1ForFork0_#t~ite16#1=|v_thread3Thread1of1ForFork0_#t~ite16#1_11|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork0_#t~nondet17#1=|v_thread3Thread1of1ForFork0_#t~nondet17#1_11|, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_17|, thread3Thread1of1ForFork0_#t~ret19#1=|v_thread3Thread1of1ForFork0_#t~ret19#1_3|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_17|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork0_#t~mem18#1=|v_thread3Thread1of1ForFork0_#t~mem18#1_5|, #race~sum~0=|v_#race~sum~0_123|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_17|, thread3Thread1of1ForFork0_#t~nondet20#1=|v_thread3Thread1of1ForFork0_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_#t~mem15#1, thread3Thread1of1ForFork0_#t~ite16#1, thread3Thread1of1ForFork0_#t~mem13#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_#t~nondet17#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_#t~ret19#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~nondet20#1, #race~A~0][175], [437#true, 289#L48-2true, Black: 418#(<= (+ ~M~0 1) 0), Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 387#true, 210#L86-4true, 383#(= |#race~M~0| 0), 69#L67true, 440#true, 389#(= |#race~A~0| 0), 371#(= |#race~N~0| 0), Black: 406#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 400#(and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 228#L56true, Black: 404#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 399#(<= ~N~0 0)]) [2025-01-09 21:33:43,649 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:33:43,649 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:33:43,649 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:33:43,649 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:33:43,701 INFO L124 PetriNetUnfolderBase]: 205/1866 cut-off events. [2025-01-09 21:33:43,701 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2025-01-09 21:33:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1866 events. 205/1866 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12100 event pairs, 54 based on Foata normal form. 0/1744 useless extension candidates. Maximal degree in co-relation 2405. Up to 200 conditions per place. [2025-01-09 21:33:43,714 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 12 selfloop transitions, 2 changer transitions 7/288 dead transitions. [2025-01-09 21:33:43,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 695 flow [2025-01-09 21:33:43,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-01-09 21:33:43,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907859078590786 [2025-01-09 21:33:43,717 INFO L175 Difference]: Start difference. First operand has 309 places, 286 transitions, 657 flow. Second operand 3 states and 1005 transitions. [2025-01-09 21:33:43,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 695 flow [2025-01-09 21:33:43,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 695 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:43,721 INFO L231 Difference]: Finished difference. Result has 294 places, 279 transitions, 627 flow [2025-01-09 21:33:43,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=294, PETRI_TRANSITIONS=279} [2025-01-09 21:33:43,722 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -44 predicate places. [2025-01-09 21:33:43,723 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 279 transitions, 627 flow [2025-01-09 21:33:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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:33:43,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:43,723 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-01-09 21:33:43,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 992400545, now seen corresponding path program 1 times [2025-01-09 21:33:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-01-09 21:33:43,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 21:33:43,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 21:33:43,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:33:43,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-01-09 21:33:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373904381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132313502] [2025-01-09 21:33:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 369 [2025-01-09 21:33:43,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 279 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 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:33:43,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 369 [2025-01-09 21:33:43,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,916 INFO L124 PetriNetUnfolderBase]: 128/1326 cut-off events. [2025-01-09 21:33:43,916 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-09 21:33:43,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 1326 events. 128/1326 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7537 event pairs, 36 based on Foata normal form. 0/1250 useless extension candidates. Maximal degree in co-relation 1706. Up to 129 conditions per place. [2025-01-09 21:33:43,925 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2025-01-09 21:33:43,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 281 transitions, 665 flow [2025-01-09 21:33:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2025-01-09 21:33:43,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105691056910569 [2025-01-09 21:33:43,927 INFO L175 Difference]: Start difference. First operand has 294 places, 279 transitions, 627 flow. Second operand 3 states and 1008 transitions. [2025-01-09 21:33:43,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 281 transitions, 665 flow [2025-01-09 21:33:43,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 641 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-09 21:33:43,931 INFO L231 Difference]: Finished difference. Result has 283 places, 0 transitions, 0 flow [2025-01-09 21:33:43,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=283, PETRI_TRANSITIONS=0} [2025-01-09 21:33:43,931 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -55 predicate places. [2025-01-09 21:33:43,932 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 0 transitions, 0 flow [2025-01-09 21:33:43,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 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:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (69 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 76 remaining) [2025-01-09 21:33:43,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (66 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (65 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 76 remaining) [2025-01-09 21:33:43,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (47 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 76 remaining) [2025-01-09 21:33:43,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (33 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (32 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 76 remaining) [2025-01-09 21:33:43,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 76 remaining) [2025-01-09 21:33:43,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 76 remaining) [2025-01-09 21:33:43,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 76 remaining) [2025-01-09 21:33:43,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 76 remaining) [2025-01-09 21:33:43,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 76 remaining) [2025-01-09 21:33:43,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 76 remaining) [2025-01-09 21:33:43,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (12 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (10 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (9 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (8 of 76 remaining) [2025-01-09 21:33:43,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 76 remaining) [2025-01-09 21:33:43,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 76 remaining) [2025-01-09 21:33:43,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 76 remaining) [2025-01-09 21:33:43,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 76 remaining) [2025-01-09 21:33:43,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 76 remaining) [2025-01-09 21:33:43,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 76 remaining) [2025-01-09 21:33:43,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 76 remaining) [2025-01-09 21:33:43,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 76 remaining) [2025-01-09 21:33:43,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:43,941 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:43,945 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:43,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:43,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:43 BasicIcfg [2025-01-09 21:33:43,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:43,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:43,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:43,952 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:43,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:37" (3/4) ... [2025-01-09 21:33:43,954 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:43,956 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:43,956 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:43,956 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:43,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 21:33:43,960 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:43,960 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:43,961 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:44,028 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:44,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:44,029 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:44,030 INFO L158 Benchmark]: Toolchain (without parser) took 7798.21ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 111.1MB in the beginning and 261.1MB in the end (delta: -150.0MB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. [2025-01-09 21:33:44,030 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:44,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.08ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:44,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.43ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:44,031 INFO L158 Benchmark]: Boogie Preprocessor took 39.61ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:44,032 INFO L158 Benchmark]: RCFGBuilder took 849.36ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.4MB in the end (delta: 11.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-01-09 21:33:44,032 INFO L158 Benchmark]: TraceAbstraction took 6588.95ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 80.6MB in the beginning and 265.4MB in the end (delta: -184.8MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:44,032 INFO L158 Benchmark]: Witness Printer took 76.78ms. Allocated memory is still 520.1MB. Free memory was 265.4MB in the beginning and 261.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:44,033 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.08ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.43ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.61ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 849.36ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.4MB in the end (delta: 11.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6588.95ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 80.6MB in the beginning and 265.4MB in the end (delta: -184.8MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. * Witness Printer took 76.78ms. Allocated memory is still 520.1MB. Free memory was 265.4MB in the beginning and 261.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 534 locations, 76 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 974 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1548 IncrementalHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 213 mSDtfsCounter, 1548 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=12, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1538 NumberOfCodeBlocks, 1538 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 2112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:44,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE