./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:26:30,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:26:30,468 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:26:30,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:26:30,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:26:30,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:26:30,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:26:30,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:26:30,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:26:30,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:26:30,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:26:30,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:30,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:30,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:26:30,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:26:30,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:26:30,490 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 -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2025-01-09 21:26:30,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:26:30,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:26:30,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:26:30,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:26:30,727 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:26:30,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-01-09 21:26:31,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14b3eafc3/ea9cf765fc384efb9a1e10e59c73f764/FLAG74a9c2022 [2025-01-09 21:26:32,196 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:26:32,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-01-09 21:26:32,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14b3eafc3/ea9cf765fc384efb9a1e10e59c73f764/FLAG74a9c2022 [2025-01-09 21:26:32,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14b3eafc3/ea9cf765fc384efb9a1e10e59c73f764 [2025-01-09 21:26:32,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:26:32,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:26:32,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:32,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:26:32,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:26:32,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d21bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32, skipping insertion in model container [2025-01-09 21:26:32,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:26:32,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:32,756 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:26:32,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:32,825 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:26:32,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32 WrapperNode [2025-01-09 21:26:32,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:32,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:32,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:26:32,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:26:32,830 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:26:32" (1/1) ... [2025-01-09 21:26:32,846 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:26:32" (1/1) ... [2025-01-09 21:26:32,868 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 150 [2025-01-09 21:26:32,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:32,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:26:32,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:26:32,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:26:32,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:26:32,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:26:32,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:26:32,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:26:32,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (1/1) ... [2025-01-09 21:26:32,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:32,945 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:26:32,947 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:26:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:26:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:26:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:26:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:26:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:26:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:26:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:26:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:26:32,965 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:26:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:26:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:26:32,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:26:32,966 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:26:33,084 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:26:33,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:26:33,361 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:26:33,362 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:26:33,396 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:26:33,398 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:26:33,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:33 BoogieIcfgContainer [2025-01-09 21:26:33,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:26:33,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:26:33,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:26:33,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:26:33,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:26:32" (1/3) ... [2025-01-09 21:26:33,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c78b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:33, skipping insertion in model container [2025-01-09 21:26:33,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:32" (2/3) ... [2025-01-09 21:26:33,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c78b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:33, skipping insertion in model container [2025-01-09 21:26:33,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:33" (3/3) ... [2025-01-09 21:26:33,407 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2025-01-09 21:26:33,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:26:33,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_07-cond_racing2.i that has 2 procedures, 195 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-01-09 21:26:33,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:26:33,486 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:26:33,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 209 transitions, 425 flow [2025-01-09 21:26:33,624 INFO L124 PetriNetUnfolderBase]: 21/276 cut-off events. [2025-01-09 21:26:33,626 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:26:33,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 276 events. 21/276 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 679 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 153. Up to 6 conditions per place. [2025-01-09 21:26:33,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 209 transitions, 425 flow [2025-01-09 21:26:33,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 209 transitions, 425 flow [2025-01-09 21:26:33,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:33,652 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;@33924ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:33,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:26:33,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:33,673 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-01-09 21:26:33,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:33,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:33,673 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:26:33,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:33,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash -429726862, now seen corresponding path program 1 times [2025-01-09 21:26:33,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:33,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109638412] [2025-01-09 21:26:33,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:33,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:26:33,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:26:33,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:33,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:34,617 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:26:34,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109638412] [2025-01-09 21:26:34,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109638412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:34,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:34,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680944165] [2025-01-09 21:26:34,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:34,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:34,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:34,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:34,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 209 [2025-01-09 21:26:34,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 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:26:34,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:34,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 209 [2025-01-09 21:26:34,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:35,019 INFO L124 PetriNetUnfolderBase]: 135/927 cut-off events. [2025-01-09 21:26:35,020 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-01-09 21:26:35,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 927 events. 135/927 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5440 event pairs, 60 based on Foata normal form. 86/907 useless extension candidates. Maximal degree in co-relation 1021. Up to 198 conditions per place. [2025-01-09 21:26:35,026 INFO L140 encePairwiseOnDemand]: 193/209 looper letters, 48 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2025-01-09 21:26:35,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 220 transitions, 553 flow [2025-01-09 21:26:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2025-01-09 21:26:35,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8740031897926634 [2025-01-09 21:26:35,040 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 425 flow. Second operand 6 states and 1096 transitions. [2025-01-09 21:26:35,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 220 transitions, 553 flow [2025-01-09 21:26:35,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 220 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:35,048 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 409 flow [2025-01-09 21:26:35,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2025-01-09 21:26:35,052 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2025-01-09 21:26:35,052 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 409 flow [2025-01-09 21:26:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 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:26:35,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:35,053 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:26:35,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:26:35,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -934569391, now seen corresponding path program 1 times [2025-01-09 21:26:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394633103] [2025-01-09 21:26:35,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:35,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:26:35,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:26:35,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:35,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:35,142 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:26:35,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:35,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394633103] [2025-01-09 21:26:35,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394633103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:35,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183677454] [2025-01-09 21:26:35,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:35,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:35,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:35,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:35,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:35,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 209 [2025-01-09 21:26:35,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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:26:35,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:35,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 209 [2025-01-09 21:26:35,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:35,283 INFO L124 PetriNetUnfolderBase]: 57/640 cut-off events. [2025-01-09 21:26:35,284 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:26:35,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 640 events. 57/640 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2927 event pairs, 25 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 634. Up to 96 conditions per place. [2025-01-09 21:26:35,288 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 22 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-01-09 21:26:35,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 469 flow [2025-01-09 21:26:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2025-01-09 21:26:35,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011164274322169 [2025-01-09 21:26:35,291 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 409 flow. Second operand 3 states and 565 transitions. [2025-01-09 21:26:35,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 469 flow [2025-01-09 21:26:35,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 202 transitions, 459 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:35,297 INFO L231 Difference]: Finished difference. Result has 198 places, 196 transitions, 407 flow [2025-01-09 21:26:35,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=198, PETRI_TRANSITIONS=196} [2025-01-09 21:26:35,299 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2025-01-09 21:26:35,300 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 196 transitions, 407 flow [2025-01-09 21:26:35,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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:26:35,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:35,301 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] [2025-01-09 21:26:35,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:26:35,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:35,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1901264912, now seen corresponding path program 1 times [2025-01-09 21:26:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676778196] [2025-01-09 21:26:35,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:35,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:26:35,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:26:35,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:35,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:35,371 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:26:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676778196] [2025-01-09 21:26:35,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676778196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128435565] [2025-01-09 21:26:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:35,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:35,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:35,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:35,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 209 [2025-01-09 21:26:35,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 196 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:26:35,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:35,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 209 [2025-01-09 21:26:35,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:35,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][202], [211#true, Black: 209#(= |ULTIMATE.start_main_~i~1#1| 0), 207#true, 198#true, 119#L952-8true]) [2025-01-09 21:26:35,529 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:35,529 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:35,529 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:35,529 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:35,538 INFO L124 PetriNetUnfolderBase]: 134/951 cut-off events. [2025-01-09 21:26:35,538 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:26:35,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 951 events. 134/951 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5563 event pairs, 32 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 1105. Up to 130 conditions per place. [2025-01-09 21:26:35,543 INFO L140 encePairwiseOnDemand]: 200/209 looper letters, 30 selfloop transitions, 6 changer transitions 0/209 dead transitions. [2025-01-09 21:26:35,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 209 transitions, 508 flow [2025-01-09 21:26:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2025-01-09 21:26:35,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8995215311004785 [2025-01-09 21:26:35,545 INFO L175 Difference]: Start difference. First operand has 198 places, 196 transitions, 407 flow. Second operand 3 states and 564 transitions. [2025-01-09 21:26:35,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 209 transitions, 508 flow [2025-01-09 21:26:35,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:35,550 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 441 flow [2025-01-09 21:26:35,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-01-09 21:26:35,551 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2025-01-09 21:26:35,551 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 441 flow [2025-01-09 21:26:35,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:26:35,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:35,551 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] [2025-01-09 21:26:35,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:26:35,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1501440717, now seen corresponding path program 1 times [2025-01-09 21:26:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307750265] [2025-01-09 21:26:35,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:35,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:26:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:26:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:35,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:35,605 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:26:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307750265] [2025-01-09 21:26:35,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307750265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:35,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:35,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168882267] [2025-01-09 21:26:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:35,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:35,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:35,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:35,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2025-01-09 21:26:35,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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:26:35,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:35,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2025-01-09 21:26:35,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:35,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][201], [211#true, Black: 209#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 213#(= |#race~global~0| 0), 198#true, 216#true, 119#L952-8true]) [2025-01-09 21:26:35,778 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:35,778 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:35,778 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:35,778 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:35,783 INFO L124 PetriNetUnfolderBase]: 139/1033 cut-off events. [2025-01-09 21:26:35,783 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-01-09 21:26:35,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 1033 events. 139/1033 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6384 event pairs, 50 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1284. Up to 220 conditions per place. [2025-01-09 21:26:35,787 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 27 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2025-01-09 21:26:35,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 521 flow [2025-01-09 21:26:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-01-09 21:26:35,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8931419457735247 [2025-01-09 21:26:35,789 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 441 flow. Second operand 3 states and 560 transitions. [2025-01-09 21:26:35,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 521 flow [2025-01-09 21:26:35,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:35,792 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 461 flow [2025-01-09 21:26:35,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2025-01-09 21:26:35,793 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2025-01-09 21:26:35,793 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 461 flow [2025-01-09 21:26:35,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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:26:35,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:35,793 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:35,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:26:35,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:35,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash -821167152, now seen corresponding path program 1 times [2025-01-09 21:26:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:35,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330476804] [2025-01-09 21:26:35,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:35,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:35,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:26:35,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:26:35,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:35,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:35,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:35,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:26:35,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:26:35,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:35,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:35,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:35,862 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:35,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:26:35,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:26:35,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:26:35,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:26:35,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:26:35,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:26:35,866 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:26:35,867 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:35,867 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:26:35,885 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:26:35,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 258 transitions, 532 flow [2025-01-09 21:26:35,927 INFO L124 PetriNetUnfolderBase]: 36/419 cut-off events. [2025-01-09 21:26:35,928 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:26:35,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 419 events. 36/419 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1291 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 278. Up to 9 conditions per place. [2025-01-09 21:26:35,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 258 transitions, 532 flow [2025-01-09 21:26:35,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 258 transitions, 532 flow [2025-01-09 21:26:35,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:35,935 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;@33924ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:35,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:26:35,941 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:35,942 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-01-09 21:26:35,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:35,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:35,942 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:26:35,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:35,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:35,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1300918130, now seen corresponding path program 1 times [2025-01-09 21:26:35,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:35,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942759515] [2025-01-09 21:26:35,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:35,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:26:35,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:26:35,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:35,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:36,267 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:26:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942759515] [2025-01-09 21:26:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942759515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823742921] [2025-01-09 21:26:36,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:36,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:36,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:36,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:36,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 258 [2025-01-09 21:26:36,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 258 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:26:36,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:36,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 258 [2025-01-09 21:26:36,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:37,084 INFO L124 PetriNetUnfolderBase]: 1710/6577 cut-off events. [2025-01-09 21:26:37,084 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-01-09 21:26:37,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9292 conditions, 6577 events. 1710/6577 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 64657 event pairs, 168 based on Foata normal form. 1223/7142 useless extension candidates. Maximal degree in co-relation 4038. Up to 1840 conditions per place. [2025-01-09 21:26:37,125 INFO L140 encePairwiseOnDemand]: 236/258 looper letters, 80 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2025-01-09 21:26:37,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 287 transitions, 760 flow [2025-01-09 21:26:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1368 transitions. [2025-01-09 21:26:37,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2025-01-09 21:26:37,128 INFO L175 Difference]: Start difference. First operand has 242 places, 258 transitions, 532 flow. Second operand 6 states and 1368 transitions. [2025-01-09 21:26:37,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 287 transitions, 760 flow [2025-01-09 21:26:37,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:37,133 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 504 flow [2025-01-09 21:26:37,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2025-01-09 21:26:37,136 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2025-01-09 21:26:37,136 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 504 flow [2025-01-09 21:26:37,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:26:37,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:26:37,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 62932625, now seen corresponding path program 1 times [2025-01-09 21:26:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085325167] [2025-01-09 21:26:37,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:37,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:26:37,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:26:37,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:37,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:37,192 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:26:37,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085325167] [2025-01-09 21:26:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085325167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:37,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:37,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100249419] [2025-01-09 21:26:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:37,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:37,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:37,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:37,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:37,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 258 [2025-01-09 21:26:37,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:26:37,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:37,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 258 [2025-01-09 21:26:37,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:37,850 INFO L124 PetriNetUnfolderBase]: 972/5053 cut-off events. [2025-01-09 21:26:37,851 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-01-09 21:26:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 5053 events. 972/5053 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 48840 event pairs, 327 based on Foata normal form. 1/4517 useless extension candidates. Maximal degree in co-relation 876. Up to 1438 conditions per place. [2025-01-09 21:26:37,879 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 31 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-01-09 21:26:37,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 246 transitions, 586 flow [2025-01-09 21:26:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2025-01-09 21:26:37,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8772609819121447 [2025-01-09 21:26:37,881 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 504 flow. Second operand 3 states and 679 transitions. [2025-01-09 21:26:37,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 246 transitions, 586 flow [2025-01-09 21:26:37,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 246 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:37,886 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 506 flow [2025-01-09 21:26:37,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2025-01-09 21:26:37,887 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2025-01-09 21:26:37,887 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 506 flow [2025-01-09 21:26:37,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:26:37,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:37,889 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] [2025-01-09 21:26:37,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:26:37,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:37,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1118350015, now seen corresponding path program 1 times [2025-01-09 21:26:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:37,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941292724] [2025-01-09 21:26:37,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:37,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:26:37,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:26:37,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:37,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:37,931 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:26:37,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941292724] [2025-01-09 21:26:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941292724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:37,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:37,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336818649] [2025-01-09 21:26:37,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:37,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:37,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:37,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 258 [2025-01-09 21:26:37,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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:26:37,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:37,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 258 [2025-01-09 21:26:37,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:38,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,466 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:38,466 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:38,466 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:38,467 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:38,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 28#$Ultimate##0true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,837 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:38,837 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:38,837 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:38,837 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:38,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 16#$Ultimate##0true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,841 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:38,841 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:38,841 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:38,841 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:38,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 73#L938-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,858 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:26:38,858 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:38,858 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:26:38,858 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:38,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [30#L938-3true, 240#true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,874 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-01-09 21:26:38,874 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:26:38,874 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:38,874 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:38,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 70#L939-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,912 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-01-09 21:26:38,912 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:26:38,912 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:38,912 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:38,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 134#L939-3true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,929 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is not cut-off event [2025-01-09 21:26:38,929 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:38,929 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:26:38,929 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:38,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 257#(= |#race~global~0| 0), 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,929 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-01-09 21:26:38,929 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:38,929 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:38,929 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:38,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 257#(= |#race~global~0| 0), 151#L952-8true, 209#L939-6true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,963 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:26:38,963 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:38,963 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:38,963 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:38,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,964 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:26:38,964 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:38,964 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:38,964 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:38,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [208#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 240#true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,964 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:26:38,964 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:38,964 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:38,964 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:38,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 209#L939-6true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:38,981 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:26:38,981 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is not cut-off event [2025-01-09 21:26:38,981 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:38,981 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:39,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 47#L939-10true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,126 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:26:39,126 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-01-09 21:26:39,126 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:26:39,126 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:26:39,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 117#L939-10true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,136 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is not cut-off event [2025-01-09 21:26:39,136 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is not cut-off event [2025-01-09 21:26:39,136 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:39,136 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:39,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [90#L939-16true, 251#true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,164 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:26:39,164 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:26:39,164 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:39,164 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:39,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 190#L939-16true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,171 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:26:39,171 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:39,171 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:26:39,171 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:39,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [141#L939-23true, 251#true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,186 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:26:39,186 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:26:39,186 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:39,186 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:39,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 121#L939-23true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,192 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is not cut-off event [2025-01-09 21:26:39,192 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2025-01-09 21:26:39,192 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:39,192 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:39,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][268], [251#true, 241#true, 242#true, 257#(= |#race~global~0| 0), 151#L952-8true, 155#L939-25true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,199 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-01-09 21:26:39,199 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-01-09 21:26:39,199 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,199 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 67#L939-25true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,204 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event [2025-01-09 21:26:39,204 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is not cut-off event [2025-01-09 21:26:39,204 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:39,204 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:39,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 186#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,205 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,205 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:39,205 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,205 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][268], [251#true, 241#true, 242#true, 257#(= |#race~global~0| 0), 11#L939-26true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,205 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,205 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:39,205 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,205 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 151#L952-8true, 155#L939-25true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,206 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event [2025-01-09 21:26:39,206 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:39,206 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is not cut-off event [2025-01-09 21:26:39,206 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:39,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 135#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,206 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,206 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,206 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:39,206 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 217#L939-26true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,212 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event [2025-01-09 21:26:39,212 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:39,212 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:39,212 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:39,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 11#L939-26true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,212 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event [2025-01-09 21:26:39,212 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:39,212 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:39,213 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:39,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 76#L939-30true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,225 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-01-09 21:26:39,225 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:26:39,226 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:39,226 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [214#L939-30true, 240#true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,235 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 257#(= |#race~global~0| 0), 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0), 217#L939-26true]) [2025-01-09 21:26:39,235 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 67#L939-25true, 257#(= |#race~global~0| 0), 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,235 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,235 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:39,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 108#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,241 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2025-01-09 21:26:39,241 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:26:39,241 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:39,241 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:39,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 165#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,244 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is not cut-off event [2025-01-09 21:26:39,244 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:26:39,245 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:39,245 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:39,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 98#L940-2true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,252 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:39,252 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-01-09 21:26:39,252 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:39,252 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:39,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 32#L940-2true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,254 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is not cut-off event [2025-01-09 21:26:39,254 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:39,254 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is not cut-off event [2025-01-09 21:26:39,254 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:39,270 INFO L124 PetriNetUnfolderBase]: 4754/15634 cut-off events. [2025-01-09 21:26:39,271 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2025-01-09 21:26:39,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23014 conditions, 15634 events. 4754/15634 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 174730 event pairs, 1581 based on Foata normal form. 0/13827 useless extension candidates. Maximal degree in co-relation 22903. Up to 3673 conditions per place. [2025-01-09 21:26:39,334 INFO L140 encePairwiseOnDemand]: 239/258 looper letters, 58 selfloop transitions, 14 changer transitions 0/273 dead transitions. [2025-01-09 21:26:39,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 273 transitions, 727 flow [2025-01-09 21:26:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-01-09 21:26:39,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8824289405684754 [2025-01-09 21:26:39,336 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 506 flow. Second operand 3 states and 683 transitions. [2025-01-09 21:26:39,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 273 transitions, 727 flow [2025-01-09 21:26:39,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 273 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:26:39,340 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 626 flow [2025-01-09 21:26:39,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=245, PETRI_TRANSITIONS=254} [2025-01-09 21:26:39,341 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2025-01-09 21:26:39,341 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 626 flow [2025-01-09 21:26:39,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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:26:39,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:39,341 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] [2025-01-09 21:26:39,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:26:39,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:39,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1422592220, now seen corresponding path program 1 times [2025-01-09 21:26:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613741129] [2025-01-09 21:26:39,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:39,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:26:39,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:26:39,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:39,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:39,378 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:26:39,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613741129] [2025-01-09 21:26:39,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613741129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:39,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:39,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:39,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242056311] [2025-01-09 21:26:39,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:39,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:39,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:39,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:39,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:39,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 258 [2025-01-09 21:26:39,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 254 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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:26:39,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:39,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 258 [2025-01-09 21:26:39,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:40,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,218 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:40,219 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:40,219 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:40,219 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:40,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 28#$Ultimate##0true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,743 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:40,743 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:40,743 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,744 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 16#$Ultimate##0true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,749 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:40,749 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,749 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,749 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:40,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 73#L938-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,780 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:26:40,780 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:40,780 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:26:40,780 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:40,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, 30#L938-3true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,800 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-01-09 21:26:40,800 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:26:40,800 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:40,800 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:40,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 70#L939-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,847 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-01-09 21:26:40,847 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:40,847 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:26:40,847 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:40,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 134#L939-3true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,983 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is not cut-off event [2025-01-09 21:26:40,984 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:26:40,984 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:40,984 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:40,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 255#true, 240#true, 243#true, 257#(= |#race~global~0| 0), 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,984 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-01-09 21:26:40,984 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:40,984 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:40,984 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:41,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,016 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:26:41,016 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:41,017 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:41,017 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:41,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, 209#L939-6true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,034 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:26:41,034 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:41,034 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:41,034 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is not cut-off event [2025-01-09 21:26:41,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 117#L939-10true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,089 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is not cut-off event [2025-01-09 21:26:41,089 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:41,089 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is not cut-off event [2025-01-09 21:26:41,089 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:41,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 46#L939-13true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,112 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:26:41,112 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-01-09 21:26:41,112 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:26:41,112 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:26:41,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 90#L939-16true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,123 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:26:41,124 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:41,124 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:41,124 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:26:41,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 190#L939-16true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,133 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:26:41,133 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:26:41,133 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:41,133 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:41,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 141#L939-23true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,151 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:26:41,151 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:41,151 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:26:41,151 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:41,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0), 121#L939-23true]) [2025-01-09 21:26:41,158 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is not cut-off event [2025-01-09 21:26:41,158 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2025-01-09 21:26:41,159 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:41,159 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:41,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 255#true, 241#true, 257#(= |#race~global~0| 0), 242#true, 151#L952-8true, 155#L939-25true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,166 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-01-09 21:26:41,166 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:41,166 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-01-09 21:26:41,166 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:41,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 76#L939-30true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,197 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-01-09 21:26:41,197 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:41,197 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:26:41,197 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:41,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, 214#L939-30true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,202 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is not cut-off event [2025-01-09 21:26:41,202 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:26:41,202 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2025-01-09 21:26:41,202 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:26:41,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 255#true, 240#true, 243#true, 67#L939-25true, 257#(= |#race~global~0| 0), 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,208 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:41,208 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:41,208 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:41,208 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:41,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 108#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,213 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2025-01-09 21:26:41,213 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:26:41,214 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:41,214 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:41,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 165#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,217 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is not cut-off event [2025-01-09 21:26:41,217 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:41,217 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:26:41,217 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:41,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 98#L940-2true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,224 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:41,224 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:41,224 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-01-09 21:26:41,224 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:41,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 32#L940-2true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,225 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is not cut-off event [2025-01-09 21:26:41,225 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:41,225 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:41,226 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is not cut-off event [2025-01-09 21:26:41,240 INFO L124 PetriNetUnfolderBase]: 4902/18005 cut-off events. [2025-01-09 21:26:41,240 INFO L125 PetriNetUnfolderBase]: For 4558/4716 co-relation queries the response was YES. [2025-01-09 21:26:41,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29579 conditions, 18005 events. 4902/18005 cut-off events. For 4558/4716 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 214252 event pairs, 2418 based on Foata normal form. 45/16200 useless extension candidates. Maximal degree in co-relation 28053. Up to 6184 conditions per place. [2025-01-09 21:26:41,328 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 52 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2025-01-09 21:26:41,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 278 transitions, 844 flow [2025-01-09 21:26:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2025-01-09 21:26:41,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746770025839793 [2025-01-09 21:26:41,330 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 626 flow. Second operand 3 states and 677 transitions. [2025-01-09 21:26:41,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 278 transitions, 844 flow [2025-01-09 21:26:41,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 278 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:41,339 INFO L231 Difference]: Finished difference. Result has 247 places, 266 transitions, 724 flow [2025-01-09 21:26:41,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=247, PETRI_TRANSITIONS=266} [2025-01-09 21:26:41,340 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2025-01-09 21:26:41,340 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 266 transitions, 724 flow [2025-01-09 21:26:41,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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:26:41,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:41,341 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] [2025-01-09 21:26:41,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:26:41,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:41,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -896994886, now seen corresponding path program 1 times [2025-01-09 21:26:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:41,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934467404] [2025-01-09 21:26:41,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:41,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:26:41,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:26:41,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:41,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:41,575 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:26:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934467404] [2025-01-09 21:26:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934467404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:41,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:41,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432062180] [2025-01-09 21:26:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:41,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:26:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:41,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:26:41,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:26:41,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 258 [2025-01-09 21:26:41,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 266 transitions, 724 flow. Second operand has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 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:26:41,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:41,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 258 [2025-01-09 21:26:41,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:43,391 INFO L124 PetriNetUnfolderBase]: 3981/20483 cut-off events. [2025-01-09 21:26:43,391 INFO L125 PetriNetUnfolderBase]: For 2390/2778 co-relation queries the response was YES. [2025-01-09 21:26:43,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29978 conditions, 20483 events. 3981/20483 cut-off events. For 2390/2778 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 264948 event pairs, 1214 based on Foata normal form. 28/17951 useless extension candidates. Maximal degree in co-relation 13515. Up to 4007 conditions per place. [2025-01-09 21:26:43,495 INFO L140 encePairwiseOnDemand]: 253/258 looper letters, 56 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-01-09 21:26:43,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 298 transitions, 910 flow [2025-01-09 21:26:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2025-01-09 21:26:43,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656330749354005 [2025-01-09 21:26:43,499 INFO L175 Difference]: Start difference. First operand has 247 places, 266 transitions, 724 flow. Second operand 6 states and 1340 transitions. [2025-01-09 21:26:43,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 298 transitions, 910 flow [2025-01-09 21:26:43,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 298 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:43,512 INFO L231 Difference]: Finished difference. Result has 253 places, 268 transitions, 722 flow [2025-01-09 21:26:43,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=253, PETRI_TRANSITIONS=268} [2025-01-09 21:26:43,512 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 11 predicate places. [2025-01-09 21:26:43,513 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 268 transitions, 722 flow [2025-01-09 21:26:43,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 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:26:43,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:43,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:43,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:26:43,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:43,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1037473512, now seen corresponding path program 1 times [2025-01-09 21:26:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:43,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337364265] [2025-01-09 21:26:43,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:43,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:26:43,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:26:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:43,575 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:26:43,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:43,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337364265] [2025-01-09 21:26:43,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337364265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:43,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:43,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007586993] [2025-01-09 21:26:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:43,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:43,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:43,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 258 [2025-01-09 21:26:43,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 268 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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:26:43,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:43,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 258 [2025-01-09 21:26:43,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:45,569 INFO L124 PetriNetUnfolderBase]: 5587/21320 cut-off events. [2025-01-09 21:26:45,570 INFO L125 PetriNetUnfolderBase]: For 5247/5442 co-relation queries the response was YES. [2025-01-09 21:26:45,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34628 conditions, 21320 events. 5587/21320 cut-off events. For 5247/5442 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 266716 event pairs, 2594 based on Foata normal form. 39/18948 useless extension candidates. Maximal degree in co-relation 34383. Up to 6886 conditions per place. [2025-01-09 21:26:45,687 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 59 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2025-01-09 21:26:45,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 292 transitions, 957 flow [2025-01-09 21:26:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2025-01-09 21:26:45,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733850129198967 [2025-01-09 21:26:45,689 INFO L175 Difference]: Start difference. First operand has 253 places, 268 transitions, 722 flow. Second operand 3 states and 676 transitions. [2025-01-09 21:26:45,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 292 transitions, 957 flow [2025-01-09 21:26:45,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 292 transitions, 951 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:45,698 INFO L231 Difference]: Finished difference. Result has 255 places, 281 transitions, 870 flow [2025-01-09 21:26:45,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=255, PETRI_TRANSITIONS=281} [2025-01-09 21:26:45,699 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 13 predicate places. [2025-01-09 21:26:45,700 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 281 transitions, 870 flow [2025-01-09 21:26:45,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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:26:45,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:45,700 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] [2025-01-09 21:26:45,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:26:45,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:45,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1479670545, now seen corresponding path program 1 times [2025-01-09 21:26:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450691215] [2025-01-09 21:26:45,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:45,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:26:45,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:26:45,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:45,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:45,749 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:26:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:45,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450691215] [2025-01-09 21:26:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450691215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880693347] [2025-01-09 21:26:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:45,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:45,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:45,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:45,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 258 [2025-01-09 21:26:45,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 281 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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:26:45,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:45,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 258 [2025-01-09 21:26:45,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:48,120 INFO L124 PetriNetUnfolderBase]: 6260/24125 cut-off events. [2025-01-09 21:26:48,121 INFO L125 PetriNetUnfolderBase]: For 12675/13127 co-relation queries the response was YES. [2025-01-09 21:26:48,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42176 conditions, 24125 events. 6260/24125 cut-off events. For 12675/13127 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 308839 event pairs, 2799 based on Foata normal form. 59/21507 useless extension candidates. Maximal degree in co-relation 41910. Up to 7732 conditions per place. [2025-01-09 21:26:48,267 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 71 selfloop transitions, 17 changer transitions 0/306 dead transitions. [2025-01-09 21:26:48,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 306 transitions, 1164 flow [2025-01-09 21:26:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2025-01-09 21:26:48,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746770025839793 [2025-01-09 21:26:48,269 INFO L175 Difference]: Start difference. First operand has 255 places, 281 transitions, 870 flow. Second operand 3 states and 677 transitions. [2025-01-09 21:26:48,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 306 transitions, 1164 flow [2025-01-09 21:26:48,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 306 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:48,288 INFO L231 Difference]: Finished difference. Result has 257 places, 294 transitions, 1012 flow [2025-01-09 21:26:48,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1012, PETRI_PLACES=257, PETRI_TRANSITIONS=294} [2025-01-09 21:26:48,288 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 15 predicate places. [2025-01-09 21:26:48,288 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 294 transitions, 1012 flow [2025-01-09 21:26:48,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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:26:48,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:48,289 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:48,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:26:48,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:48,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash -110095157, now seen corresponding path program 1 times [2025-01-09 21:26:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198134999] [2025-01-09 21:26:48,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:48,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:48,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:26:48,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:26:48,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:48,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:48,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:48,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:26:48,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:26:48,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:48,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:48,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:48,344 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:26:48,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:26:48,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:26:48,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:26:48,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:26:48,345 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:48,345 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:48,345 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:26:48,371 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:26:48,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 307 transitions, 641 flow [2025-01-09 21:26:48,432 INFO L124 PetriNetUnfolderBase]: 54/605 cut-off events. [2025-01-09 21:26:48,433 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:26:48,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 605 events. 54/605 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2135 event pairs, 1 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 427. Up to 12 conditions per place. [2025-01-09 21:26:48,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 307 transitions, 641 flow [2025-01-09 21:26:48,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 307 transitions, 641 flow [2025-01-09 21:26:48,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:48,443 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;@33924ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:48,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:26:48,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:48,451 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-01-09 21:26:48,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:48,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:48,451 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:26:48,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:48,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1762124146, now seen corresponding path program 1 times [2025-01-09 21:26:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549844915] [2025-01-09 21:26:48,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:48,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:26:48,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:26:48,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:48,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:48,863 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:26:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549844915] [2025-01-09 21:26:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549844915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:48,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900821618] [2025-01-09 21:26:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:48,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:48,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:48,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:48,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 307 [2025-01-09 21:26:48,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 307 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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:26:48,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:48,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 307 [2025-01-09 21:26:48,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:55,527 INFO L124 PetriNetUnfolderBase]: 20344/69062 cut-off events. [2025-01-09 21:26:55,527 INFO L125 PetriNetUnfolderBase]: For 1107/1109 co-relation queries the response was YES. [2025-01-09 21:26:55,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97669 conditions, 69062 events. 20344/69062 cut-off events. For 1107/1109 co-relation queries the response was YES. Maximal size of possible extension queue 1510. Compared 951414 event pairs, 6970 based on Foata normal form. 13397/75651 useless extension candidates. Maximal degree in co-relation 11521. Up to 20303 conditions per place. [2025-01-09 21:26:55,947 INFO L140 encePairwiseOnDemand]: 279/307 looper letters, 112 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2025-01-09 21:26:55,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 354 transitions, 969 flow [2025-01-09 21:26:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1640 transitions. [2025-01-09 21:26:55,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8903365906623235 [2025-01-09 21:26:55,950 INFO L175 Difference]: Start difference. First operand has 286 places, 307 transitions, 641 flow. Second operand 6 states and 1640 transitions. [2025-01-09 21:26:55,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 354 transitions, 969 flow [2025-01-09 21:26:55,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 354 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:55,954 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 601 flow [2025-01-09 21:26:55,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2025-01-09 21:26:55,955 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-01-09 21:26:55,955 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 601 flow [2025-01-09 21:26:55,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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:26:55,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:55,956 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:26:55,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:26:55,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:55,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 900292337, now seen corresponding path program 1 times [2025-01-09 21:26:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:55,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471265688] [2025-01-09 21:26:55,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:55,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:26:55,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:26:55,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:55,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:55,996 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:26:55,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:55,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471265688] [2025-01-09 21:26:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471265688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:55,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:55,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391516482] [2025-01-09 21:26:55,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:55,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:55,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:55,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:56,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 307 [2025-01-09 21:26:56,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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:26:56,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:56,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 307 [2025-01-09 21:26:56,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:00,239 INFO L124 PetriNetUnfolderBase]: 10694/37921 cut-off events. [2025-01-09 21:27:00,239 INFO L125 PetriNetUnfolderBase]: For 2257/2257 co-relation queries the response was YES. [2025-01-09 21:27:00,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53569 conditions, 37921 events. 10694/37921 cut-off events. For 2257/2257 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 489065 event pairs, 5582 based on Foata normal form. 1/34178 useless extension candidates. Maximal degree in co-relation 7136. Up to 14422 conditions per place. [2025-01-09 21:27:00,476 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 39 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-01-09 21:27:00,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 699 flow [2025-01-09 21:27:00,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2025-01-09 21:27:00,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599348534201955 [2025-01-09 21:27:00,478 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 601 flow. Second operand 3 states and 792 transitions. [2025-01-09 21:27:00,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 699 flow [2025-01-09 21:27:00,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 289 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:00,482 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 603 flow [2025-01-09 21:27:00,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=286, PETRI_TRANSITIONS=283} [2025-01-09 21:27:00,483 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2025-01-09 21:27:00,483 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 603 flow [2025-01-09 21:27:00,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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:27:00,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:00,484 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] [2025-01-09 21:27:00,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:27:00,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:27:00,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1357658915, now seen corresponding path program 1 times [2025-01-09 21:27:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:00,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801852426] [2025-01-09 21:27:00,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:00,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:27:00,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:27:00,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:00,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:00,510 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:27:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:00,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801852426] [2025-01-09 21:27:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801852426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:00,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240046445] [2025-01-09 21:27:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:00,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:00,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:00,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:00,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:00,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 307 [2025-01-09 21:27:00,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 283 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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:27:00,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:00,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 307 [2025-01-09 21:27:00,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:01,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:01,767 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:27:01,767 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:27:01,767 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:27:01,767 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:27:05,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 135#$Ultimate##0true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:05,360 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:27:05,360 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,360 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,360 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:05,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 78#$Ultimate##0true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:05,364 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:27:05,364 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:05,364 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,364 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 82#L938-3true, 174#L952-8true, 295#true]) [2025-01-09 21:27:05,602 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:27:05,602 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:27:05,602 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:27:05,603 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:27:05,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 173#L938-3true, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:05,874 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-01-09 21:27:05,874 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:05,874 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:27:05,874 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:27:06,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 110#L939-3true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:06,841 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-01-09 21:27:06,841 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:06,841 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:06,841 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:27:07,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, 7#L939-3true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:07,274 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is not cut-off event [2025-01-09 21:27:07,274 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:27:07,274 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:27:07,274 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:27:07,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][311], [282#true, 301#(= |#race~global~0| 0), 157#L939-5true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:07,274 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-01-09 21:27:07,274 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:07,274 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:27:07,274 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][311], [75#L939-6true, 282#true, 301#(= |#race~global~0| 0), 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,178 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 157#L939-5true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,178 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:27:08,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 19#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,178 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,178 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [75#L939-6true, 299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,751 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:27:08,751 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:27:08,751 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is not cut-off event [2025-01-09 21:27:08,751 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:27:10,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 141#L939-10true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:10,237 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:27:10,237 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:10,237 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:10,237 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-01-09 21:27:10,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [211#L939-10true, 299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:10,765 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is not cut-off event [2025-01-09 21:27:10,765 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:10,765 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:10,765 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is not cut-off event [2025-01-09 21:27:11,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 135#$Ultimate##0true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 174#L952-8true, 285#true, 295#true, 287#true]) [2025-01-09 21:27:11,721 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is not cut-off event [2025-01-09 21:27:11,721 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:11,721 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:27:11,721 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:11,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 173#L938-3true, 174#L952-8true, 285#true, 295#true, 287#true]) [2025-01-09 21:27:11,722 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:27:11,722 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:11,725 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:27:11,725 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:11,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 78#$Ultimate##0true, 283#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 284#true, 174#L952-8true, 295#true, 287#true]) [2025-01-09 21:27:11,968 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is not cut-off event [2025-01-09 21:27:11,968 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:11,968 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:11,968 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:27:11,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1233] t_funEXIT-->L952-8: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_15|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [299#true, 78#$Ultimate##0true, 283#true, 135#$Ultimate##0true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:11,969 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is not cut-off event [2025-01-09 21:27:11,969 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:11,969 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:27:11,969 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event