./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d4763f16046b6456ca743de56b5f11abb2b329f5e398f00096b23501accfbe71 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:01,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:01,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:01,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:01,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:01,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:01,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:01,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:01,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:01,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:01,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:01,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:01,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:01,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:01,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:01,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:01,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:01,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:01,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:01,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:01,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:01,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:01,531 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/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 -> d4763f16046b6456ca743de56b5f11abb2b329f5e398f00096b23501accfbe71 [2025-04-29 11:10:01,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:01,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:01,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:01,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:01,757 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:01,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.c [2025-04-29 11:10:03,082 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3df67d85c/6465b5e91d814bf3a189bbcae06f6472/FLAG7bcabe6d7 [2025-04-29 11:10:03,245 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:03,246 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.c [2025-04-29 11:10:03,248 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:03,248 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:03,255 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3df67d85c/6465b5e91d814bf3a189bbcae06f6472/FLAG7bcabe6d7 [2025-04-29 11:10:04,134 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3df67d85c/6465b5e91d814bf3a189bbcae06f6472 [2025-04-29 11:10:04,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:04,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:04,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:04,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:04,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:04,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f81c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04, skipping insertion in model container [2025-04-29 11:10:04,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:04,308 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:04,314 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:04,343 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:04,360 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:04,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04 WrapperNode [2025-04-29 11:10:04,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:04,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:04,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:04,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:04,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,395 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 99 [2025-04-29 11:10:04,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:04,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:04,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:04,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:04,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:04,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:04,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:04,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:04,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (1/1) ... [2025-04-29 11:10:04,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:04,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:04,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:10:04,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:10:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:10:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:10:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:10:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:10:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:04,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:10:04,464 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:10:04,465 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:10:04,536 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:04,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:04,681 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:04,681 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:04,696 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:04,696 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:10:04,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:04 BoogieIcfgContainer [2025-04-29 11:10:04,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:04,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:04,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:04,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:04,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:04" (1/3) ... [2025-04-29 11:10:04,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e233c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:04, skipping insertion in model container [2025-04-29 11:10:04,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:04" (2/3) ... [2025-04-29 11:10:04,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e233c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:04, skipping insertion in model container [2025-04-29 11:10:04,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:04" (3/3) ... [2025-04-29 11:10:04,704 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.c [2025-04-29 11:10:04,715 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:04,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_25-struct_nr_true.c that has 2 procedures, 113 locations, 115 edges, 1 initial locations, 0 loop locations, and 10 error locations. [2025-04-29 11:10:04,718 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:04,767 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:10:04,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 116 transitions, 239 flow [2025-04-29 11:10:04,837 INFO L116 PetriNetUnfolderBase]: 4/115 cut-off events. [2025-04-29 11:10:04,840 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:04,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 4/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2025-04-29 11:10:04,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 116 transitions, 239 flow [2025-04-29 11:10:04,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 110 transitions, 223 flow [2025-04-29 11:10:04,855 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:04,864 INFO L340 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;@2ecfc6f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:04,865 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:10:04,868 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:04,868 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-29 11:10:04,868 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:04,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:04,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:04,870 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:10:04,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2081330030, now seen corresponding path program 1 times [2025-04-29 11:10:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:04,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289437827] [2025-04-29 11:10:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:04,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:10:04,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:10:04,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:04,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:04,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289437827] [2025-04-29 11:10:04,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289437827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:04,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:04,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991286575] [2025-04-29 11:10:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:04,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:05,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:05,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:05,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 116 [2025-04-29 11:10:05,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-04-29 11:10:05,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:05,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 116 [2025-04-29 11:10:05,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:05,201 INFO L116 PetriNetUnfolderBase]: 110/767 cut-off events. [2025-04-29 11:10:05,201 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:05,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 767 events. 110/767 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4688 event pairs, 49 based on Foata normal form. 43/715 useless extension candidates. Maximal degree in co-relation 1012. Up to 167 conditions per place. [2025-04-29 11:10:05,211 INFO L140 encePairwiseOnDemand]: 91/116 looper letters, 29 selfloop transitions, 15 changer transitions 1/119 dead transitions. [2025-04-29 11:10:05,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 329 flow [2025-04-29 11:10:05,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2025-04-29 11:10:05,222 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.853448275862069 [2025-04-29 11:10:05,223 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 223 flow. Second operand 3 states and 297 transitions. [2025-04-29 11:10:05,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 329 flow [2025-04-29 11:10:05,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 119 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:10:05,232 INFO L231 Difference]: Finished difference. Result has 108 places, 114 transitions, 328 flow [2025-04-29 11:10:05,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=108, PETRI_TRANSITIONS=114} [2025-04-29 11:10:05,236 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -2 predicate places. [2025-04-29 11:10:05,236 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 114 transitions, 328 flow [2025-04-29 11:10:05,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-04-29 11:10:05,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:05,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:05,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:05,237 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:10:05,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash 936035845, now seen corresponding path program 1 times [2025-04-29 11:10:05,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:05,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017523958] [2025-04-29 11:10:05,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:05,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:10:05,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:10:05,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:05,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:05,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017523958] [2025-04-29 11:10:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017523958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469724968] [2025-04-29 11:10:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:05,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:05,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:05,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:05,346 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116 [2025-04-29 11:10:05,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 114 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-04-29 11:10:05,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:05,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116 [2025-04-29 11:10:05,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:05,444 INFO L116 PetriNetUnfolderBase]: 132/891 cut-off events. [2025-04-29 11:10:05,445 INFO L117 PetriNetUnfolderBase]: For 294/314 co-relation queries the response was YES. [2025-04-29 11:10:05,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 891 events. 132/891 cut-off events. For 294/314 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5773 event pairs, 59 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 1477. Up to 229 conditions per place. [2025-04-29 11:10:05,449 INFO L140 encePairwiseOnDemand]: 108/116 looper letters, 29 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2025-04-29 11:10:05,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 124 transitions, 446 flow [2025-04-29 11:10:05,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-04-29 11:10:05,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8247126436781609 [2025-04-29 11:10:05,454 INFO L175 Difference]: Start difference. First operand has 108 places, 114 transitions, 328 flow. Second operand 3 states and 287 transitions. [2025-04-29 11:10:05,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 124 transitions, 446 flow [2025-04-29 11:10:05,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 124 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:05,459 INFO L231 Difference]: Finished difference. Result has 109 places, 122 transitions, 384 flow [2025-04-29 11:10:05,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=109, PETRI_TRANSITIONS=122} [2025-04-29 11:10:05,461 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -1 predicate places. [2025-04-29 11:10:05,461 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 122 transitions, 384 flow [2025-04-29 11:10:05,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-04-29 11:10:05,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:05,462 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] [2025-04-29 11:10:05,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:05,462 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:10:05,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1272454356, now seen corresponding path program 1 times [2025-04-29 11:10:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:05,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363400233] [2025-04-29 11:10:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:05,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:10:05,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:10:05,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:05,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:05,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:05,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363400233] [2025-04-29 11:10:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363400233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:10:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732783891] [2025-04-29 11:10:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:05,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:05,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:05,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:05,635 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 116 [2025-04-29 11:10:05,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 122 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-04-29 11:10:05,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:05,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 116 [2025-04-29 11:10:05,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:05,668 INFO L116 PetriNetUnfolderBase]: 1/162 cut-off events. [2025-04-29 11:10:05,668 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:10:05,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 162 events. 1/162 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 174 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 194. Up to 21 conditions per place. [2025-04-29 11:10:05,669 INFO L140 encePairwiseOnDemand]: 112/116 looper letters, 2 selfloop transitions, 4 changer transitions 3/96 dead transitions. [2025-04-29 11:10:05,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 96 transitions, 258 flow [2025-04-29 11:10:05,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-04-29 11:10:05,673 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8936781609195402 [2025-04-29 11:10:05,673 INFO L175 Difference]: Start difference. First operand has 109 places, 122 transitions, 384 flow. Second operand 3 states and 311 transitions. [2025-04-29 11:10:05,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 96 transitions, 258 flow [2025-04-29 11:10:05,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 228 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-29 11:10:05,675 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 218 flow [2025-04-29 11:10:05,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2025-04-29 11:10:05,676 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -9 predicate places. [2025-04-29 11:10:05,676 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 218 flow [2025-04-29 11:10:05,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-04-29 11:10:05,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:05,677 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] [2025-04-29 11:10:05,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:05,677 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:10:05,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash 975717744, now seen corresponding path program 1 times [2025-04-29 11:10:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:05,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523449111] [2025-04-29 11:10:05,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:05,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:05,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:10:05,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:10:05,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:05,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523449111] [2025-04-29 11:10:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523449111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:05,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:05,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624329733] [2025-04-29 11:10:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:05,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:05,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:05,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:05,771 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116 [2025-04-29 11:10:05,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-04-29 11:10:05,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:05,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116 [2025-04-29 11:10:05,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:05,799 INFO L116 PetriNetUnfolderBase]: 1/154 cut-off events. [2025-04-29 11:10:05,800 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:10:05,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 154 events. 1/154 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 148 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 189. Up to 31 conditions per place. [2025-04-29 11:10:05,801 INFO L140 encePairwiseOnDemand]: 113/116 looper letters, 18 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-04-29 11:10:05,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 256 flow [2025-04-29 11:10:05,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-04-29 11:10:05,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8132183908045977 [2025-04-29 11:10:05,802 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 218 flow. Second operand 3 states and 283 transitions. [2025-04-29 11:10:05,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 256 flow [2025-04-29 11:10:05,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:10:05,804 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 216 flow [2025-04-29 11:10:05,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-04-29 11:10:05,805 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -12 predicate places. [2025-04-29 11:10:05,805 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 216 flow [2025-04-29 11:10:05,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-04-29 11:10:05,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:05,805 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] [2025-04-29 11:10:05,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:05,805 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:10:05,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:05,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1712040013, now seen corresponding path program 1 times [2025-04-29 11:10:05,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:05,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885208328] [2025-04-29 11:10:05,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:05,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:05,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:05,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:05,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:05,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:05,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885208328] [2025-04-29 11:10:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885208328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338355461] [2025-04-29 11:10:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:05,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:05,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:05,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:05,900 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116 [2025-04-29 11:10:05,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-04-29 11:10:05,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:05,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116 [2025-04-29 11:10:05,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:05,923 INFO L116 PetriNetUnfolderBase]: 1/152 cut-off events. [2025-04-29 11:10:05,923 INFO L117 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-04-29 11:10:05,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 152 events. 1/152 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 139 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 187. Up to 32 conditions per place. [2025-04-29 11:10:05,924 INFO L140 encePairwiseOnDemand]: 113/116 looper letters, 17 selfloop transitions, 2 changer transitions 7/91 dead transitions. [2025-04-29 11:10:05,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 91 transitions, 256 flow [2025-04-29 11:10:05,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-04-29 11:10:05,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7988505747126436 [2025-04-29 11:10:05,925 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 216 flow. Second operand 3 states and 278 transitions. [2025-04-29 11:10:05,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 91 transitions, 256 flow [2025-04-29 11:10:05,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 91 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:05,926 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 197 flow [2025-04-29 11:10:05,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=97, PETRI_TRANSITIONS=84} [2025-04-29 11:10:05,927 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -13 predicate places. [2025-04-29 11:10:05,929 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 197 flow [2025-04-29 11:10:05,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-04-29 11:10:05,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:05,929 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] [2025-04-29 11:10:05,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:05,929 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:10:05,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1269277374, now seen corresponding path program 1 times [2025-04-29 11:10:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:05,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878692900] [2025-04-29 11:10:05,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:05,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:10:05,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:10:05,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:05,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878692900] [2025-04-29 11:10:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878692900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:05,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724400040] [2025-04-29 11:10:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:05,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:05,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:05,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:06,009 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116 [2025-04-29 11:10:06,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-04-29 11:10:06,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:06,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116 [2025-04-29 11:10:06,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:06,025 INFO L116 PetriNetUnfolderBase]: 0/109 cut-off events. [2025-04-29 11:10:06,025 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:10:06,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 109 events. 0/109 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 59 event pairs, 0 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2025-04-29 11:10:06,026 INFO L140 encePairwiseOnDemand]: 114/116 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-04-29 11:10:06,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 83 transitions, 227 flow [2025-04-29 11:10:06,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-04-29 11:10:06,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8045977011494253 [2025-04-29 11:10:06,028 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 197 flow. Second operand 3 states and 280 transitions. [2025-04-29 11:10:06,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 83 transitions, 227 flow [2025-04-29 11:10:06,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 83 transitions, 221 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:06,030 INFO L231 Difference]: Finished difference. Result has 90 places, 0 transitions, 0 flow [2025-04-29 11:10:06,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=90, PETRI_TRANSITIONS=0} [2025-04-29 11:10:06,030 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -20 predicate places. [2025-04-29 11:10:06,031 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 0 transitions, 0 flow [2025-04-29 11:10:06,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-04-29 11:10:06,033 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-29 11:10:06,033 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-29 11:10:06,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-29 11:10:06,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:10:06,034 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:10:06,038 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:10:06,039 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:10:06,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:10:06 BasicIcfg [2025-04-29 11:10:06,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:10:06,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:10:06,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:10:06,044 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:10:06,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:04" (3/4) ... [2025-04-29 11:10:06,046 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:10:06,048 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:10:06,051 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 11:10:06,051 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:10:06,052 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:10:06,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:10:06,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:10:06,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:10:06,101 INFO L158 Benchmark]: Toolchain (without parser) took 1964.94ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 115.4MB in the end (delta: 9.4MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-04-29 11:10:06,102 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:10:06,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.58ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 109.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:10:06,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.31ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:10:06,102 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:10:06,102 INFO L158 Benchmark]: RCFGBuilder took 274.79ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 93.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:10:06,102 INFO L158 Benchmark]: TraceAbstraction took 1346.23ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 120.7MB in the end (delta: -28.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:10:06,102 INFO L158 Benchmark]: Witness Printer took 56.59ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 115.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:10:06,105 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.58ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 109.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.31ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.79ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 93.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1346.23ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 120.7MB in the end (delta: -28.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.59ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 115.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 26]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 28]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 29]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 30]: 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 3 procedures, 158 locations, 163 edges, 15 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: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 317 IncrementalHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 13 mSDtfsCounter, 317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=2, InterpolantAutomatonStates: 18, 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.3s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:10:06,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE