./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f07f53b70b113c395773370086657e2cda4799340cf7206361c323fc526218bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:28,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:28,072 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:22:28,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:28,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:28,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:28,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:28,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:28,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:28,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:28,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:28,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:28,110 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:28,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:28,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:28,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:28,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:28,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:28,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:28,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:28,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:28,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:28,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:28,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:28,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:28,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:28,114 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 -> f07f53b70b113c395773370086657e2cda4799340cf7206361c323fc526218bf [2025-01-09 21:22:28,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:28,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:28,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:28,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:28,348 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:28,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i [2025-01-09 21:22:29,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6e5b09f/d1528ed380f541f585eb0c96a1cad20d/FLAGd90bf2b97 [2025-01-09 21:22:29,720 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:29,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i [2025-01-09 21:22:29,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6e5b09f/d1528ed380f541f585eb0c96a1cad20d/FLAGd90bf2b97 [2025-01-09 21:22:29,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6e5b09f/d1528ed380f541f585eb0c96a1cad20d [2025-01-09 21:22:29,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:29,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:29,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:29,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:29,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:29,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29, skipping insertion in model container [2025-01-09 21:22:29,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:30,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:30,028 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:30,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:30,093 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:30,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30 WrapperNode [2025-01-09 21:22:30,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:30,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:30,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:30,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:30,101 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:22:30" (1/1) ... [2025-01-09 21:22:30,109 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:22:30" (1/1) ... [2025-01-09 21:22:30,129 INFO L138 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2025-01-09 21:22:30,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:30,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:30,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:30,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:30,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:30,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:30,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:30,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:30,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (1/1) ... [2025-01-09 21:22:30,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:30,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:30,171 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:22:30,174 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:22:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:30,190 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:22:30,263 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:30,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:30,435 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:30,435 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:30,460 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:30,460 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:30,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:30 BoogieIcfgContainer [2025-01-09 21:22:30,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:30,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:30,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:30,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:30,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:29" (1/3) ... [2025-01-09 21:22:30,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354e5807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:30, skipping insertion in model container [2025-01-09 21:22:30,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:30" (2/3) ... [2025-01-09 21:22:30,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354e5807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:30, skipping insertion in model container [2025-01-09 21:22:30,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:30" (3/3) ... [2025-01-09 21:22:30,467 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_12-fldsense_nr.i [2025-01-09 21:22:30,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:30,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_12-fldsense_nr.i that has 2 procedures, 107 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-01-09 21:22:30,483 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:30,530 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:30,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 106 transitions, 216 flow [2025-01-09 21:22:30,598 INFO L124 PetriNetUnfolderBase]: 0/105 cut-off events. [2025-01-09 21:22:30,599 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:30,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 0/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:22:30,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 106 transitions, 216 flow [2025-01-09 21:22:30,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 213 flow [2025-01-09 21:22:30,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:30,622 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;@7d2fdf69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:30,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 21:22:30,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:30,636 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-01-09 21:22:30,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:30,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:30,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:30,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:22:30,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash 44161446, now seen corresponding path program 1 times [2025-01-09 21:22:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108068551] [2025-01-09 21:22:30,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:30,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:22:30,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:22:30,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:30,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:31,298 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:22:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108068551] [2025-01-09 21:22:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108068551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:31,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196690661] [2025-01-09 21:22:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:31,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:31,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:31,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:31,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 106 [2025-01-09 21:22:31,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 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:22:31,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:31,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 106 [2025-01-09 21:22:31,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:31,935 INFO L124 PetriNetUnfolderBase]: 302/1394 cut-off events. [2025-01-09 21:22:31,935 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:31,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1394 events. 302/1394 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9419 event pairs, 83 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 2023. Up to 309 conditions per place. [2025-01-09 21:22:31,949 INFO L140 encePairwiseOnDemand]: 84/106 looper letters, 98 selfloop transitions, 42 changer transitions 0/215 dead transitions. [2025-01-09 21:22:31,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 215 transitions, 713 flow [2025-01-09 21:22:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2025-01-09 21:22:31,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2025-01-09 21:22:31,962 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 213 flow. Second operand 6 states and 598 transitions. [2025-01-09 21:22:31,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 215 transitions, 713 flow [2025-01-09 21:22:31,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 215 transitions, 712 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:31,971 INFO L231 Difference]: Finished difference. Result has 118 places, 151 transitions, 528 flow [2025-01-09 21:22:31,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=118, PETRI_TRANSITIONS=151} [2025-01-09 21:22:31,975 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2025-01-09 21:22:31,975 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 151 transitions, 528 flow [2025-01-09 21:22:31,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 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:22:31,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:31,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:31,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:22:31,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash 507360683, now seen corresponding path program 1 times [2025-01-09 21:22:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:31,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607863842] [2025-01-09 21:22:31,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:31,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:22:32,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:22:32,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:32,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:32,330 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:22:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607863842] [2025-01-09 21:22:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607863842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796493289] [2025-01-09 21:22:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:32,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:32,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:32,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2025-01-09 21:22:32,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 151 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 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:22:32,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:32,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2025-01-09 21:22:32,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:32,854 INFO L124 PetriNetUnfolderBase]: 480/1947 cut-off events. [2025-01-09 21:22:32,854 INFO L125 PetriNetUnfolderBase]: For 639/676 co-relation queries the response was YES. [2025-01-09 21:22:32,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4061 conditions, 1947 events. 480/1947 cut-off events. For 639/676 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14354 event pairs, 130 based on Foata normal form. 23/1899 useless extension candidates. Maximal degree in co-relation 4023. Up to 698 conditions per place. [2025-01-09 21:22:32,866 INFO L140 encePairwiseOnDemand]: 89/106 looper letters, 112 selfloop transitions, 53 changer transitions 3/242 dead transitions. [2025-01-09 21:22:32,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 242 transitions, 1232 flow [2025-01-09 21:22:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 558 transitions. [2025-01-09 21:22:32,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773584905660378 [2025-01-09 21:22:32,869 INFO L175 Difference]: Start difference. First operand has 118 places, 151 transitions, 528 flow. Second operand 6 states and 558 transitions. [2025-01-09 21:22:32,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 242 transitions, 1232 flow [2025-01-09 21:22:32,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 242 transitions, 1232 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:32,879 INFO L231 Difference]: Finished difference. Result has 128 places, 204 transitions, 1044 flow [2025-01-09 21:22:32,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1044, PETRI_PLACES=128, PETRI_TRANSITIONS=204} [2025-01-09 21:22:32,880 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 19 predicate places. [2025-01-09 21:22:32,880 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 204 transitions, 1044 flow [2025-01-09 21:22:32,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 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:22:32,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:32,880 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] [2025-01-09 21:22:32,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:22:32,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:22:32,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash 564656499, now seen corresponding path program 1 times [2025-01-09 21:22:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:32,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607001566] [2025-01-09 21:22:32,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:32,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:32,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:22:32,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:22:32,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:32,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:33,123 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:22:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:33,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607001566] [2025-01-09 21:22:33,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607001566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:33,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80909029] [2025-01-09 21:22:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:33,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:33,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:33,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:33,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:33,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2025-01-09 21:22:33,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 204 transitions, 1044 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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:22:33,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:33,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2025-01-09 21:22:33,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:33,619 INFO L124 PetriNetUnfolderBase]: 630/2490 cut-off events. [2025-01-09 21:22:33,620 INFO L125 PetriNetUnfolderBase]: For 2476/2528 co-relation queries the response was YES. [2025-01-09 21:22:33,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 2490 events. 630/2490 cut-off events. For 2476/2528 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 19171 event pairs, 151 based on Foata normal form. 25/2429 useless extension candidates. Maximal degree in co-relation 6247. Up to 957 conditions per place. [2025-01-09 21:22:33,637 INFO L140 encePairwiseOnDemand]: 89/106 looper letters, 154 selfloop transitions, 68 changer transitions 0/298 dead transitions. [2025-01-09 21:22:33,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 298 transitions, 2024 flow [2025-01-09 21:22:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2025-01-09 21:22:33,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8490566037735849 [2025-01-09 21:22:33,639 INFO L175 Difference]: Start difference. First operand has 128 places, 204 transitions, 1044 flow. Second operand 6 states and 540 transitions. [2025-01-09 21:22:33,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 298 transitions, 2024 flow [2025-01-09 21:22:33,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 298 transitions, 2016 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:33,653 INFO L231 Difference]: Finished difference. Result has 138 places, 265 transitions, 1756 flow [2025-01-09 21:22:33,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1756, PETRI_PLACES=138, PETRI_TRANSITIONS=265} [2025-01-09 21:22:33,654 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 29 predicate places. [2025-01-09 21:22:33,654 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 265 transitions, 1756 flow [2025-01-09 21:22:33,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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:22:33,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:33,656 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] [2025-01-09 21:22:33,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:33,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:22:33,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1712932708, now seen corresponding path program 1 times [2025-01-09 21:22:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:33,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255280961] [2025-01-09 21:22:33,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:33,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:22:33,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:22:33,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:33,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:33,716 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:22:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255280961] [2025-01-09 21:22:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255280961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:33,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:33,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:22:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649043939] [2025-01-09 21:22:33,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:33,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:33,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:33,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:33,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 106 [2025-01-09 21:22:33,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 265 transitions, 1756 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:22:33,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:33,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 106 [2025-01-09 21:22:33,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:33,772 INFO L124 PetriNetUnfolderBase]: 5/194 cut-off events. [2025-01-09 21:22:33,773 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-01-09 21:22:33,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 194 events. 5/194 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 383 event pairs, 3 based on Foata normal form. 2/194 useless extension candidates. Maximal degree in co-relation 379. Up to 19 conditions per place. [2025-01-09 21:22:33,773 INFO L140 encePairwiseOnDemand]: 102/106 looper letters, 5 selfloop transitions, 4 changer transitions 11/103 dead transitions. [2025-01-09 21:22:33,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 103 transitions, 362 flow [2025-01-09 21:22:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2025-01-09 21:22:33,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2025-01-09 21:22:33,775 INFO L175 Difference]: Start difference. First operand has 138 places, 265 transitions, 1756 flow. Second operand 3 states and 304 transitions. [2025-01-09 21:22:33,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 103 transitions, 362 flow [2025-01-09 21:22:33,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 103 transitions, 230 flow, removed 26 selfloop flow, removed 30 redundant places. [2025-01-09 21:22:33,779 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 192 flow [2025-01-09 21:22:33,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2025-01-09 21:22:33,779 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2025-01-09 21:22:33,779 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 192 flow [2025-01-09 21:22:33,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:22:33,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:33,780 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] [2025-01-09 21:22:33,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:22:33,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:22:33,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash 332824644, now seen corresponding path program 1 times [2025-01-09 21:22:33,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:33,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008244567] [2025-01-09 21:22:33,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:33,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:33,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:33,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:33,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:33,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:33,997 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:22:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:33,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008244567] [2025-01-09 21:22:33,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008244567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:33,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:33,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026201441] [2025-01-09 21:22:33,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:33,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:33,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:33,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:33,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:34,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-01-09 21:22:34,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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:22:34,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:34,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-01-09 21:22:34,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:34,270 INFO L124 PetriNetUnfolderBase]: 21/223 cut-off events. [2025-01-09 21:22:34,270 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:22:34,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 223 events. 21/223 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 574 event pairs, 11 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 282. Up to 36 conditions per place. [2025-01-09 21:22:34,271 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 19 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2025-01-09 21:22:34,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 270 flow [2025-01-09 21:22:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-01-09 21:22:34,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.860062893081761 [2025-01-09 21:22:34,276 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 192 flow. Second operand 6 states and 547 transitions. [2025-01-09 21:22:34,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 270 flow [2025-01-09 21:22:34,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 98 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:34,278 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 196 flow [2025-01-09 21:22:34,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2025-01-09 21:22:34,280 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -10 predicate places. [2025-01-09 21:22:34,280 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 196 flow [2025-01-09 21:22:34,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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:22:34,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:34,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:34,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:34,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:22:34,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1590098400, now seen corresponding path program 1 times [2025-01-09 21:22:34,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:34,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973096259] [2025-01-09 21:22:34,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:34,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:22:34,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:22:34,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:34,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:34,554 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:22:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973096259] [2025-01-09 21:22:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973096259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:34,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:34,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758811222] [2025-01-09 21:22:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:34,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:34,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:34,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:34,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2025-01-09 21:22:34,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 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:22:34,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:34,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2025-01-09 21:22:34,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:34,821 INFO L124 PetriNetUnfolderBase]: 23/222 cut-off events. [2025-01-09 21:22:34,821 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-09 21:22:34,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 222 events. 23/222 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 646 event pairs, 15 based on Foata normal form. 3/219 useless extension candidates. Maximal degree in co-relation 288. Up to 47 conditions per place. [2025-01-09 21:22:34,822 INFO L140 encePairwiseOnDemand]: 101/106 looper letters, 0 selfloop transitions, 0 changer transitions 97/97 dead transitions. [2025-01-09 21:22:34,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 97 transitions, 270 flow [2025-01-09 21:22:34,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2025-01-09 21:22:34,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8254716981132075 [2025-01-09 21:22:34,823 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 196 flow. Second operand 6 states and 525 transitions. [2025-01-09 21:22:34,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 97 transitions, 270 flow [2025-01-09 21:22:34,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 260 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:22:34,824 INFO L231 Difference]: Finished difference. Result has 98 places, 0 transitions, 0 flow [2025-01-09 21:22:34,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=98, PETRI_TRANSITIONS=0} [2025-01-09 21:22:34,825 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -11 predicate places. [2025-01-09 21:22:34,825 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 0 transitions, 0 flow [2025-01-09 21:22:34,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 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:22:34,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-01-09 21:22:34,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-01-09 21:22:34,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-01-09 21:22:34,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-01-09 21:22:34,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-01-09 21:22:34,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-01-09 21:22:34,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-01-09 21:22:34,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-01-09 21:22:34,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-01-09 21:22:34,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:22:34,829 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:22:34,833 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:22:34,833 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:22:34,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:22:34 BasicIcfg [2025-01-09 21:22:34,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:22:34,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:22:34,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:22:34,838 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:22:34,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:30" (3/4) ... [2025-01-09 21:22:34,840 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:22:34,842 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-09 21:22:34,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:22:34,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:22:34,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:22:34,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:22:34,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:22:34,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:22:34,899 INFO L158 Benchmark]: Toolchain (without parser) took 5147.61ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 103.2MB in the beginning and 198.8MB in the end (delta: -95.5MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2025-01-09 21:22:34,899 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:34,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 83.3MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:22:34,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:34,902 INFO L158 Benchmark]: Boogie Preprocessor took 17.68ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 80.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:34,902 INFO L158 Benchmark]: RCFGBuilder took 312.51ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 62.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:22:34,902 INFO L158 Benchmark]: TraceAbstraction took 4375.06ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 61.2MB in the beginning and 203.7MB in the end (delta: -142.5MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2025-01-09 21:22:34,903 INFO L158 Benchmark]: Witness Printer took 60.41ms. Allocated memory is still 318.8MB. Free memory was 203.7MB in the beginning and 198.8MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:34,904 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 83.3MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.68ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 80.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 312.51ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 62.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4375.06ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 61.2MB in the beginning and 203.7MB in the end (delta: -142.5MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 60.41ms. Allocated memory is still 318.8MB. Free memory was 203.7MB in the beginning and 198.8MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 693]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 693]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 683]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 683]: 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, 135 locations, 9 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: 4.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 754 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 425 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1752 IncrementalHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 359 mSolverCounterUnsat, 17 mSDtfsCounter, 1752 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1756occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:22:34,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE