./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:31,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:31,483 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:30:31,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:31,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:31,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:31,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:31,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:31,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:31,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:31,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:31,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:31,518 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:31,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:31,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:31,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:31,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:31,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:31,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:31,523 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 -> 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 [2025-01-09 21:30:31,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:31,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:31,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:31,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:31,938 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:31,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2025-01-09 21:30:33,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b93a4aa7f/494012643eee42af99de91c51a5744bd/FLAGce3933a93 [2025-01-09 21:30:33,410 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:33,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2025-01-09 21:30:33,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b93a4aa7f/494012643eee42af99de91c51a5744bd/FLAGce3933a93 [2025-01-09 21:30:33,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b93a4aa7f/494012643eee42af99de91c51a5744bd [2025-01-09 21:30:33,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:33,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:33,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:33,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:33,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:33,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4c90b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33, skipping insertion in model container [2025-01-09 21:30:33,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:33,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:33,622 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:33,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:33,656 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:33,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33 WrapperNode [2025-01-09 21:30:33,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:33,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:33,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:33,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:33,663 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:30:33" (1/1) ... [2025-01-09 21:30:33,671 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:30:33" (1/1) ... [2025-01-09 21:30:33,694 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 231 [2025-01-09 21:30:33,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:33,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:33,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:33,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:33,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:33,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:33,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:33,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:33,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:33,764 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:30:33,766 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:30:33,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:33,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:33,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:33,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:33,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:33,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:33,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:33,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:33,783 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:30:33,864 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:33,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:34,296 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:34,296 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:34,314 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:34,317 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:34,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:34 BoogieIcfgContainer [2025-01-09 21:30:34,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:34,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:34,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:34,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:34,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:33" (1/3) ... [2025-01-09 21:30:34,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149f18c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:34, skipping insertion in model container [2025-01-09 21:30:34,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (2/3) ... [2025-01-09 21:30:34,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149f18c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:34, skipping insertion in model container [2025-01-09 21:30:34,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:34" (3/3) ... [2025-01-09 21:30:34,326 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2025-01-09 21:30:34,338 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:34,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-symm.wvr.c that has 3 procedures, 296 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-01-09 21:30:34,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:34,439 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:30:34,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 313 transitions, 640 flow [2025-01-09 21:30:34,600 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2025-01-09 21:30:34,601 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:34,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 311 events. 18/311 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 593 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 170. Up to 2 conditions per place. [2025-01-09 21:30:34,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 313 transitions, 640 flow [2025-01-09 21:30:34,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 291 transitions, 594 flow [2025-01-09 21:30:34,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:34,647 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;@112cdb77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:34,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:30:34,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:34,659 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:30:34,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:34,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:34,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:34,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1426550473, now seen corresponding path program 1 times [2025-01-09 21:30:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6358403] [2025-01-09 21:30:34,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:30:34,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:30:34,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,821 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:30:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6358403] [2025-01-09 21:30:34,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6358403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971706999] [2025-01-09 21:30:34,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2025-01-09 21:30:34,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:34,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2025-01-09 21:30:34,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,946 INFO L124 PetriNetUnfolderBase]: 17/369 cut-off events. [2025-01-09 21:30:34,947 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:30:34,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 369 events. 17/369 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1069 event pairs, 3 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 258. Up to 16 conditions per place. [2025-01-09 21:30:34,950 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 9 selfloop transitions, 2 changer transitions 2/284 dead transitions. [2025-01-09 21:30:34,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 602 flow [2025-01-09 21:30:34,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2025-01-09 21:30:34,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952076677316294 [2025-01-09 21:30:34,962 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 594 flow. Second operand 3 states and 894 transitions. [2025-01-09 21:30:34,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 602 flow [2025-01-09 21:30:34,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:30:34,970 INFO L231 Difference]: Finished difference. Result has 279 places, 282 transitions, 572 flow [2025-01-09 21:30:34,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=279, PETRI_TRANSITIONS=282} [2025-01-09 21:30:34,974 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -3 predicate places. [2025-01-09 21:30:34,975 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 282 transitions, 572 flow [2025-01-09 21:30:34,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:34,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:34,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:34,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:34,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1258392661, now seen corresponding path program 1 times [2025-01-09 21:30:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275699112] [2025-01-09 21:30:34,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:30:34,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:30:34,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,007 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:30:35,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275699112] [2025-01-09 21:30:35,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275699112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968119489] [2025-01-09 21:30:35,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2025-01-09 21:30:35,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 282 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:35,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2025-01-09 21:30:35,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,065 INFO L124 PetriNetUnfolderBase]: 18/413 cut-off events. [2025-01-09 21:30:35,066 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:35,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 413 events. 18/413 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1226 event pairs, 3 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 407. Up to 17 conditions per place. [2025-01-09 21:30:35,069 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-01-09 21:30:35,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 281 transitions, 592 flow [2025-01-09 21:30:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2025-01-09 21:30:35,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2025-01-09 21:30:35,071 INFO L175 Difference]: Start difference. First operand has 279 places, 282 transitions, 572 flow. Second operand 3 states and 888 transitions. [2025-01-09 21:30:35,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 281 transitions, 592 flow [2025-01-09 21:30:35,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,075 INFO L231 Difference]: Finished difference. Result has 276 places, 281 transitions, 570 flow [2025-01-09 21:30:35,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=276, PETRI_TRANSITIONS=281} [2025-01-09 21:30:35,076 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -6 predicate places. [2025-01-09 21:30:35,076 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 281 transitions, 570 flow [2025-01-09 21:30:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:35,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,077 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] [2025-01-09 21:30:35,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:35,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:35,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash -258362343, now seen corresponding path program 1 times [2025-01-09 21:30:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453923528] [2025-01-09 21:30:35,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:30:35,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:30:35,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,111 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:30:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453923528] [2025-01-09 21:30:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453923528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381581158] [2025-01-09 21:30:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:35,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 281 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:35,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,192 INFO L124 PetriNetUnfolderBase]: 27/518 cut-off events. [2025-01-09 21:30:35,192 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:35,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 518 events. 27/518 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2186 event pairs, 5 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 508. Up to 21 conditions per place. [2025-01-09 21:30:35,196 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-01-09 21:30:35,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 280 transitions, 592 flow [2025-01-09 21:30:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-01-09 21:30:35,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-01-09 21:30:35,202 INFO L175 Difference]: Start difference. First operand has 276 places, 281 transitions, 570 flow. Second operand 3 states and 886 transitions. [2025-01-09 21:30:35,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 280 transitions, 592 flow [2025-01-09 21:30:35,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 280 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,207 INFO L231 Difference]: Finished difference. Result has 275 places, 280 transitions, 568 flow [2025-01-09 21:30:35,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=275, PETRI_TRANSITIONS=280} [2025-01-09 21:30:35,208 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -7 predicate places. [2025-01-09 21:30:35,209 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 280 transitions, 568 flow [2025-01-09 21:30:35,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,209 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] [2025-01-09 21:30:35,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:35,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:35,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 928634739, now seen corresponding path program 1 times [2025-01-09 21:30:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772120573] [2025-01-09 21:30:35,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:30:35,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:30:35,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772120573] [2025-01-09 21:30:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772120573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698294869] [2025-01-09 21:30:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:35,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 280 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:35,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,357 INFO L124 PetriNetUnfolderBase]: 23/429 cut-off events. [2025-01-09 21:30:35,357 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:35,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 429 events. 23/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1561 event pairs, 5 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 412. Up to 21 conditions per place. [2025-01-09 21:30:35,360 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-01-09 21:30:35,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 279 transitions, 590 flow [2025-01-09 21:30:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-01-09 21:30:35,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-01-09 21:30:35,363 INFO L175 Difference]: Start difference. First operand has 275 places, 280 transitions, 568 flow. Second operand 3 states and 886 transitions. [2025-01-09 21:30:35,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 279 transitions, 590 flow [2025-01-09 21:30:35,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 279 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,367 INFO L231 Difference]: Finished difference. Result has 274 places, 279 transitions, 566 flow [2025-01-09 21:30:35,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=274, PETRI_TRANSITIONS=279} [2025-01-09 21:30:35,368 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -8 predicate places. [2025-01-09 21:30:35,368 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 279 transitions, 566 flow [2025-01-09 21:30:35,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,369 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] [2025-01-09 21:30:35,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:35,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:35,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash -775813011, now seen corresponding path program 1 times [2025-01-09 21:30:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365485183] [2025-01-09 21:30:35,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:30:35,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:30:35,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,416 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:30:35,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365485183] [2025-01-09 21:30:35,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365485183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678095444] [2025-01-09 21:30:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:35,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 279 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:35,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,552 INFO L124 PetriNetUnfolderBase]: 22/422 cut-off events. [2025-01-09 21:30:35,553 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:30:35,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 422 events. 22/422 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1409 event pairs, 5 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 397. Up to 22 conditions per place. [2025-01-09 21:30:35,555 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-01-09 21:30:35,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 278 transitions, 588 flow [2025-01-09 21:30:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-01-09 21:30:35,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-01-09 21:30:35,558 INFO L175 Difference]: Start difference. First operand has 274 places, 279 transitions, 566 flow. Second operand 3 states and 886 transitions. [2025-01-09 21:30:35,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 278 transitions, 588 flow [2025-01-09 21:30:35,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 278 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,563 INFO L231 Difference]: Finished difference. Result has 273 places, 278 transitions, 564 flow [2025-01-09 21:30:35,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=273, PETRI_TRANSITIONS=278} [2025-01-09 21:30:35,564 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -9 predicate places. [2025-01-09 21:30:35,565 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 278 transitions, 564 flow [2025-01-09 21:30:35,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,566 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] [2025-01-09 21:30:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:35,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:35,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1604001172, now seen corresponding path program 1 times [2025-01-09 21:30:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108334852] [2025-01-09 21:30:35,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:30:35,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:30:35,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,630 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:30:35,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108334852] [2025-01-09 21:30:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108334852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009195341] [2025-01-09 21:30:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:35,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 278 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:35,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,693 INFO L124 PetriNetUnfolderBase]: 26/507 cut-off events. [2025-01-09 21:30:35,693 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 507 events. 26/507 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2012 event pairs, 5 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 475. Up to 22 conditions per place. [2025-01-09 21:30:35,696 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-01-09 21:30:35,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 586 flow [2025-01-09 21:30:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-01-09 21:30:35,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2025-01-09 21:30:35,698 INFO L175 Difference]: Start difference. First operand has 273 places, 278 transitions, 564 flow. Second operand 3 states and 886 transitions. [2025-01-09 21:30:35,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 586 flow [2025-01-09 21:30:35,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,702 INFO L231 Difference]: Finished difference. Result has 272 places, 277 transitions, 562 flow [2025-01-09 21:30:35,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=272, PETRI_TRANSITIONS=277} [2025-01-09 21:30:35,703 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2025-01-09 21:30:35,703 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 277 transitions, 562 flow [2025-01-09 21:30:35,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,704 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] [2025-01-09 21:30:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:35,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -633730726, now seen corresponding path program 1 times [2025-01-09 21:30:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398213068] [2025-01-09 21:30:35,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:30:35,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:30:35,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,793 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:30:35,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398213068] [2025-01-09 21:30:35,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398213068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270643067] [2025-01-09 21:30:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:35,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 277 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:35,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,883 INFO L124 PetriNetUnfolderBase]: 48/722 cut-off events. [2025-01-09 21:30:35,883 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:35,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 722 events. 48/722 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3773 event pairs, 8 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 698. Up to 36 conditions per place. [2025-01-09 21:30:35,890 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2025-01-09 21:30:35,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 278 transitions, 595 flow [2025-01-09 21:30:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-01-09 21:30:35,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2025-01-09 21:30:35,892 INFO L175 Difference]: Start difference. First operand has 272 places, 277 transitions, 562 flow. Second operand 3 states and 891 transitions. [2025-01-09 21:30:35,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 278 transitions, 595 flow [2025-01-09 21:30:35,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,896 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 573 flow [2025-01-09 21:30:35,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2025-01-09 21:30:35,897 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-01-09 21:30:35,898 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 573 flow [2025-01-09 21:30:35,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,899 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] [2025-01-09 21:30:35,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:35,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:35,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1204903880, now seen corresponding path program 1 times [2025-01-09 21:30:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397824620] [2025-01-09 21:30:35,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:30:35,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:30:35,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,969 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:30:35,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397824620] [2025-01-09 21:30:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397824620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773475152] [2025-01-09 21:30:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:35,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:35,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:35,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,043 INFO L124 PetriNetUnfolderBase]: 50/743 cut-off events. [2025-01-09 21:30:36,043 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:30:36,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 743 events. 50/743 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4003 event pairs, 8 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 653. Up to 36 conditions per place. [2025-01-09 21:30:36,048 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2025-01-09 21:30:36,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 278 transitions, 606 flow [2025-01-09 21:30:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-01-09 21:30:36,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2025-01-09 21:30:36,054 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 573 flow. Second operand 3 states and 891 transitions. [2025-01-09 21:30:36,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 278 transitions, 606 flow [2025-01-09 21:30:36,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,061 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 588 flow [2025-01-09 21:30:36,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2025-01-09 21:30:36,062 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-01-09 21:30:36,063 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 588 flow [2025-01-09 21:30:36,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:36,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,065 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] [2025-01-09 21:30:36,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:36,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2044432989, now seen corresponding path program 1 times [2025-01-09 21:30:36,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122016550] [2025-01-09 21:30:36,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:30:36,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:30:36,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,128 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:30:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122016550] [2025-01-09 21:30:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122016550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624282959] [2025-01-09 21:30:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:36,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:36,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:36,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,234 INFO L124 PetriNetUnfolderBase]: 56/962 cut-off events. [2025-01-09 21:30:36,234 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-01-09 21:30:36,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 962 events. 56/962 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5988 event pairs, 4 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 879. Up to 55 conditions per place. [2025-01-09 21:30:36,240 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/280 dead transitions. [2025-01-09 21:30:36,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 280 transitions, 631 flow [2025-01-09 21:30:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-01-09 21:30:36,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2025-01-09 21:30:36,242 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 588 flow. Second operand 3 states and 893 transitions. [2025-01-09 21:30:36,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 280 transitions, 631 flow [2025-01-09 21:30:36,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 280 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,246 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 603 flow [2025-01-09 21:30:36,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2025-01-09 21:30:36,248 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-01-09 21:30:36,248 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 603 flow [2025-01-09 21:30:36,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:36,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,249 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] [2025-01-09 21:30:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:36,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -294538650, now seen corresponding path program 1 times [2025-01-09 21:30:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000555438] [2025-01-09 21:30:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:30:36,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:30:36,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,307 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:30:36,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000555438] [2025-01-09 21:30:36,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000555438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583504800] [2025-01-09 21:30:36,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2025-01-09 21:30:36,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:30:36,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2025-01-09 21:30:36,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,389 INFO L124 PetriNetUnfolderBase]: 42/793 cut-off events. [2025-01-09 21:30:36,389 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-01-09 21:30:36,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 793 events. 42/793 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4526 event pairs, 4 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 727. Up to 25 conditions per place. [2025-01-09 21:30:36,394 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-01-09 21:30:36,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 277 transitions, 628 flow [2025-01-09 21:30:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-01-09 21:30:36,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2025-01-09 21:30:36,396 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 603 flow. Second operand 3 states and 892 transitions. [2025-01-09 21:30:36,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 277 transitions, 628 flow [2025-01-09 21:30:36,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 277 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,400 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 605 flow [2025-01-09 21:30:36,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2025-01-09 21:30:36,402 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2025-01-09 21:30:36,403 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 605 flow [2025-01-09 21:30:36,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:30:36,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,403 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] [2025-01-09 21:30:36,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:36,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:36,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1228796145, now seen corresponding path program 1 times [2025-01-09 21:30:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595831765] [2025-01-09 21:30:36,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:30:36,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:30:36,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,454 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:30:36,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595831765] [2025-01-09 21:30:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595831765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354247500] [2025-01-09 21:30:36,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:36,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:36,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,554 INFO L124 PetriNetUnfolderBase]: 60/1068 cut-off events. [2025-01-09 21:30:36,555 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-01-09 21:30:36,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1068 events. 60/1068 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7055 event pairs, 6 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1022. Up to 47 conditions per place. [2025-01-09 21:30:36,560 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/279 dead transitions. [2025-01-09 21:30:36,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 648 flow [2025-01-09 21:30:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-01-09 21:30:36,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2025-01-09 21:30:36,562 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 605 flow. Second operand 3 states and 893 transitions. [2025-01-09 21:30:36,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 648 flow [2025-01-09 21:30:36,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 279 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:36,566 INFO L231 Difference]: Finished difference. Result has 269 places, 276 transitions, 616 flow [2025-01-09 21:30:36,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=269, PETRI_TRANSITIONS=276} [2025-01-09 21:30:36,567 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2025-01-09 21:30:36,567 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 276 transitions, 616 flow [2025-01-09 21:30:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:30:36,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,568 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] [2025-01-09 21:30:36,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:36,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:36,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1090064911, now seen corresponding path program 1 times [2025-01-09 21:30:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693259193] [2025-01-09 21:30:36,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:30:36,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:30:36,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,604 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:30:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693259193] [2025-01-09 21:30:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693259193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050393946] [2025-01-09 21:30:36,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2025-01-09 21:30:36,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 276 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:36,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2025-01-09 21:30:36,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,718 INFO L124 PetriNetUnfolderBase]: 45/1163 cut-off events. [2025-01-09 21:30:36,719 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2025-01-09 21:30:36,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1163 events. 45/1163 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7236 event pairs, 2 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 1095. Up to 42 conditions per place. [2025-01-09 21:30:36,723 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-01-09 21:30:36,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 279 transitions, 653 flow [2025-01-09 21:30:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-01-09 21:30:36,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2025-01-09 21:30:36,725 INFO L175 Difference]: Start difference. First operand has 269 places, 276 transitions, 616 flow. Second operand 3 states and 898 transitions. [2025-01-09 21:30:36,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 279 transitions, 653 flow [2025-01-09 21:30:36,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 279 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,728 INFO L231 Difference]: Finished difference. Result has 270 places, 276 transitions, 626 flow [2025-01-09 21:30:36,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=270, PETRI_TRANSITIONS=276} [2025-01-09 21:30:36,729 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-01-09 21:30:36,729 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 276 transitions, 626 flow [2025-01-09 21:30:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:36,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:36,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:36,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:36,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash -419615918, now seen corresponding path program 1 times [2025-01-09 21:30:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50877105] [2025-01-09 21:30:36,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 21:30:36,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 21:30:36,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,767 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:30:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50877105] [2025-01-09 21:30:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50877105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751941548] [2025-01-09 21:30:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2025-01-09 21:30:36,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 276 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:36,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2025-01-09 21:30:36,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,903 INFO L124 PetriNetUnfolderBase]: 46/1201 cut-off events. [2025-01-09 21:30:36,903 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2025-01-09 21:30:36,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1201 events. 46/1201 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7646 event pairs, 4 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1156. Up to 43 conditions per place. [2025-01-09 21:30:36,910 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-01-09 21:30:36,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 663 flow [2025-01-09 21:30:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-01-09 21:30:36,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2025-01-09 21:30:36,913 INFO L175 Difference]: Start difference. First operand has 270 places, 276 transitions, 626 flow. Second operand 3 states and 898 transitions. [2025-01-09 21:30:36,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 663 flow [2025-01-09 21:30:36,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 279 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,917 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 636 flow [2025-01-09 21:30:36,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2025-01-09 21:30:36,918 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2025-01-09 21:30:36,918 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 636 flow [2025-01-09 21:30:36,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:36,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,919 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] [2025-01-09 21:30:36,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:36,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:36,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1794766840, now seen corresponding path program 1 times [2025-01-09 21:30:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643340585] [2025-01-09 21:30:36,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 21:30:36,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 21:30:36,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,957 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:30:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643340585] [2025-01-09 21:30:36,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643340585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866011330] [2025-01-09 21:30:36,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2025-01-09 21:30:36,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 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:30:36,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2025-01-09 21:30:36,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:37,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,045 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2025-01-09 21:30:37,046 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,046 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:30:37,046 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,048 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:30:37,048 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:30:37,048 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,048 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,049 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,049 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:30:37,049 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,049 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:30:37,049 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:30:37,049 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 164#L50-41true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,050 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-01-09 21:30:37,050 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,050 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,050 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 53#L50-42true, Black: 327#true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,069 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-01-09 21:30:37,069 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:30:37,069 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:30:37,069 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:37,071 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 109#L50-40true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,071 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2025-01-09 21:30:37,071 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,071 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,071 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:30:37,072 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 53#L50-42true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,072 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-01-09 21:30:37,072 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:30:37,072 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-01-09 21:30:37,072 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:30:37,072 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:37,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, 99#L52true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,073 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:30:37,073 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:30:37,073 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:30:37,073 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,074 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, 99#L52true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,074 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,074 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:30:37,074 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:30:37,074 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:30:37,074 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:37,077 INFO L124 PetriNetUnfolderBase]: 71/1065 cut-off events. [2025-01-09 21:30:37,077 INFO L125 PetriNetUnfolderBase]: For 42/45 co-relation queries the response was YES. [2025-01-09 21:30:37,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1065 events. 71/1065 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6389 event pairs, 6 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1123. Up to 88 conditions per place. [2025-01-09 21:30:37,080 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-01-09 21:30:37,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 276 transitions, 661 flow [2025-01-09 21:30:37,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-01-09 21:30:37,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2025-01-09 21:30:37,082 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 636 flow. Second operand 3 states and 892 transitions. [2025-01-09 21:30:37,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 276 transitions, 661 flow [2025-01-09 21:30:37,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 276 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:37,086 INFO L231 Difference]: Finished difference. Result has 272 places, 275 transitions, 638 flow [2025-01-09 21:30:37,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=272, PETRI_TRANSITIONS=275} [2025-01-09 21:30:37,086 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2025-01-09 21:30:37,086 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 275 transitions, 638 flow [2025-01-09 21:30:37,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 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:30:37,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:37,087 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] [2025-01-09 21:30:37,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:37,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:37,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1865615290, now seen corresponding path program 1 times [2025-01-09 21:30:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:37,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710701302] [2025-01-09 21:30:37,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:37,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:30:37,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:30:37,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:37,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:37,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:30:37,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710701302] [2025-01-09 21:30:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710701302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:37,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886564457] [2025-01-09 21:30:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:37,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:37,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:37,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:37,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 275 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:37,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:37,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:37,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:37,272 INFO L124 PetriNetUnfolderBase]: 43/1137 cut-off events. [2025-01-09 21:30:37,272 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2025-01-09 21:30:37,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 1137 events. 43/1137 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7051 event pairs, 3 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1161. Up to 30 conditions per place. [2025-01-09 21:30:37,279 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 10 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2025-01-09 21:30:37,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 272 transitions, 654 flow [2025-01-09 21:30:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2025-01-09 21:30:37,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446219382321619 [2025-01-09 21:30:37,282 INFO L175 Difference]: Start difference. First operand has 272 places, 275 transitions, 638 flow. Second operand 3 states and 887 transitions. [2025-01-09 21:30:37,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 272 transitions, 654 flow [2025-01-09 21:30:37,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 272 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:37,287 INFO L231 Difference]: Finished difference. Result has 269 places, 272 transitions, 630 flow [2025-01-09 21:30:37,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=269, PETRI_TRANSITIONS=272} [2025-01-09 21:30:37,288 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2025-01-09 21:30:37,288 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 272 transitions, 630 flow [2025-01-09 21:30:37,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:37,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:37,289 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:30:37,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:37,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:30:37,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1871924535, now seen corresponding path program 1 times [2025-01-09 21:30:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:37,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064718678] [2025-01-09 21:30:37,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:37,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:30:37,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:30:37,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:37,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:37,329 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:30:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:37,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064718678] [2025-01-09 21:30:37,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064718678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:37,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:37,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712691883] [2025-01-09 21:30:37,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:37,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:37,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:37,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:37,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-01-09 21:30:37,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 272 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:37,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:37,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-01-09 21:30:37,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:37,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,409 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,409 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,409 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,409 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([801] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,413 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-01-09 21:30:37,413 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,413 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,413 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,414 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,414 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-01-09 21:30:37,414 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,414 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,414 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:30:37,414 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:37,418 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([801] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2025-01-09 21:30:37,418 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2025-01-09 21:30:37,418 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2025-01-09 21:30:37,418 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-01-09 21:30:37,418 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2025-01-09 21:30:37,418 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:30:37,441 INFO L124 PetriNetUnfolderBase]: 47/1092 cut-off events. [2025-01-09 21:30:37,442 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2025-01-09 21:30:37,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1092 events. 47/1092 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6278 event pairs, 3 based on Foata normal form. 3/1031 useless extension candidates. Maximal degree in co-relation 1078. Up to 47 conditions per place. [2025-01-09 21:30:37,445 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 271/271 dead transitions. [2025-01-09 21:30:37,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 271 transitions, 652 flow [2025-01-09 21:30:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2025-01-09 21:30:37,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2025-01-09 21:30:37,447 INFO L175 Difference]: Start difference. First operand has 269 places, 272 transitions, 630 flow. Second operand 3 states and 888 transitions. [2025-01-09 21:30:37,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 271 transitions, 652 flow [2025-01-09 21:30:37,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 271 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:37,450 INFO L231 Difference]: Finished difference. Result has 267 places, 0 transitions, 0 flow [2025-01-09 21:30:37,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=267, PETRI_TRANSITIONS=0} [2025-01-09 21:30:37,451 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -15 predicate places. [2025-01-09 21:30:37,451 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 0 transitions, 0 flow [2025-01-09 21:30:37,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:30:37,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-01-09 21:30:37,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-01-09 21:30:37,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-01-09 21:30:37,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-01-09 21:30:37,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-01-09 21:30:37,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-01-09 21:30:37,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-01-09 21:30:37,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-01-09 21:30:37,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-01-09 21:30:37,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:37,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:37,463 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:37,463 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:37,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:37 BasicIcfg [2025-01-09 21:30:37,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:37,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:37,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:37,471 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:37,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:34" (3/4) ... [2025-01-09 21:30:37,475 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:37,481 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:37,481 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:37,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:30:37,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:37,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:37,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:37,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:37,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:37,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:37,546 INFO L158 Benchmark]: Toolchain (without parser) took 4094.63ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 134.7MB in the beginning and 178.2MB in the end (delta: -43.6MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-01-09 21:30:37,546 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 226.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:37,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.90ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 122.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:37,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.08ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 120.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:37,547 INFO L158 Benchmark]: Boogie Preprocessor took 32.35ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:37,547 INFO L158 Benchmark]: RCFGBuilder took 585.96ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 96.2MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:30:37,547 INFO L158 Benchmark]: TraceAbstraction took 3150.90ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 95.7MB in the beginning and 184.2MB in the end (delta: -88.5MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2025-01-09 21:30:37,547 INFO L158 Benchmark]: Witness Printer took 74.70ms. Allocated memory is still 234.9MB. Free memory was 184.2MB in the beginning and 178.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:37,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 226.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.90ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 122.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.08ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 120.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.35ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 585.96ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 96.2MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3150.90ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 95.7MB in the beginning and 184.2MB in the end (delta: -88.5MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * Witness Printer took 74.70ms. Allocated memory is still 234.9MB. Free memory was 184.2MB in the beginning and 178.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 448 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 106 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=638occurred in iteration=14, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:37,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE