./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/fkp2014.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/pthread-lit/fkp2014.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 f24d9db33c7d5aecb89ac12017849974773f5d17a3292112bf25190c4dfae9f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:16:44,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:16:44,950 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:16:44,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:16:44,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:16:44,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:16:44,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:16:44,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:16:44,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:16:44,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:16:44,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:16:44,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:16:44,993 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:16:44,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:16:44,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:16:44,993 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:16:44,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:16:44,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:16:44,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:16:44,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:16:44,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:16:44,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:16:44,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:44,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:44,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:44,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:16:44,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:44,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:44,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:16:44,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:16:44,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:16:44,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:16:44,998 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 -> f24d9db33c7d5aecb89ac12017849974773f5d17a3292112bf25190c4dfae9f0 [2025-01-09 21:16:45,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:16:45,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:16:45,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:16:45,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:16:45,306 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:16:45,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/fkp2014.i [2025-01-09 21:16:46,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e4560420/9956f9fca7d448da8b66f4dc88f0f3c2/FLAGaf2ba5fbc [2025-01-09 21:16:46,859 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:16:46,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2014.i [2025-01-09 21:16:46,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e4560420/9956f9fca7d448da8b66f4dc88f0f3c2/FLAGaf2ba5fbc [2025-01-09 21:16:46,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e4560420/9956f9fca7d448da8b66f4dc88f0f3c2 [2025-01-09 21:16:46,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:16:46,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:16:46,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:16:46,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:16:46,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:16:46,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:46" (1/1) ... [2025-01-09 21:16:46,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c74e963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:46, skipping insertion in model container [2025-01-09 21:16:46,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:46" (1/1) ... [2025-01-09 21:16:46,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:16:47,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:16:47,173 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:16:47,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:16:47,249 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:16:47,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47 WrapperNode [2025-01-09 21:16:47,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:16:47,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:16:47,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:16:47,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:16:47,257 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:16:47" (1/1) ... [2025-01-09 21:16:47,266 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:16:47" (1/1) ... [2025-01-09 21:16:47,281 INFO L138 Inliner]: procedures = 172, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 79 [2025-01-09 21:16:47,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:16:47,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:16:47,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:16:47,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:16:47,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:16:47,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:16:47,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:16:47,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:16:47,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (1/1) ... [2025-01-09 21:16:47,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:16:47,343 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:16:47,346 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:16:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:16:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-01-09 21:16:47,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-01-09 21:16:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:16:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:16:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:16:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:16:47,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:16:47,370 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:16:47,467 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:16:47,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:16:47,600 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:16:47,600 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:16:47,634 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:16:47,634 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:16:47,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:16:47 BoogieIcfgContainer [2025-01-09 21:16:47,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:16:47,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:16:47,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:16:47,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:16:47,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:16:46" (1/3) ... [2025-01-09 21:16:47,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a794a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:16:47, skipping insertion in model container [2025-01-09 21:16:47,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:47" (2/3) ... [2025-01-09 21:16:47,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a794a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:16:47, skipping insertion in model container [2025-01-09 21:16:47,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:16:47" (3/3) ... [2025-01-09 21:16:47,643 INFO L128 eAbstractionObserver]: Analyzing ICFG fkp2014.i [2025-01-09 21:16:47,656 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:16:47,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fkp2014.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 7 error locations. [2025-01-09 21:16:47,660 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:16:47,718 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:47,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 80 transitions, 164 flow [2025-01-09 21:16:47,794 INFO L124 PetriNetUnfolderBase]: 3/89 cut-off events. [2025-01-09 21:16:47,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:47,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 89 events. 3/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-01-09 21:16:47,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 80 transitions, 164 flow [2025-01-09 21:16:47,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 80 transitions, 164 flow [2025-01-09 21:16:47,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:47,821 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;@4e0b0b8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:47,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 21:16:47,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:47,828 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-01-09 21:16:47,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:47,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:47,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:47,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:16:47,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 385353101, now seen corresponding path program 1 times [2025-01-09 21:16:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959348026] [2025-01-09 21:16:47,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:47,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:16:47,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:16:47,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:47,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:48,003 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:16:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959348026] [2025-01-09 21:16:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959348026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:48,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:48,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169019230] [2025-01-09 21:16:48,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:48,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:48,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:48,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:48,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 80 [2025-01-09 21:16:48,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:16:48,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:48,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 80 [2025-01-09 21:16:48,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:48,113 INFO L124 PetriNetUnfolderBase]: 3/104 cut-off events. [2025-01-09 21:16:48,113 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:48,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 104 events. 3/104 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 142 event pairs, 3 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 73. Up to 16 conditions per place. [2025-01-09 21:16:48,114 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 8 selfloop transitions, 2 changer transitions 1/70 dead transitions. [2025-01-09 21:16:48,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 164 flow [2025-01-09 21:16:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-01-09 21:16:48,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8375 [2025-01-09 21:16:48,129 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 164 flow. Second operand 3 states and 201 transitions. [2025-01-09 21:16:48,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 164 flow [2025-01-09 21:16:48,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:48,140 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 146 flow [2025-01-09 21:16:48,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-01-09 21:16:48,146 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2025-01-09 21:16:48,146 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 146 flow [2025-01-09 21:16:48,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:16:48,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:48,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:48,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:16:48,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:16:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 913757174, now seen corresponding path program 1 times [2025-01-09 21:16:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189974330] [2025-01-09 21:16:48,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:48,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:16:48,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:16:48,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:48,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:48,258 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:16:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189974330] [2025-01-09 21:16:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189974330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:48,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:48,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087802302] [2025-01-09 21:16:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:48,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:48,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:48,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:48,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 80 [2025-01-09 21:16:48,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:16:48,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:48,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 80 [2025-01-09 21:16:48,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:48,313 INFO L124 PetriNetUnfolderBase]: 0/77 cut-off events. [2025-01-09 21:16:48,313 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:16:48,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 77 events. 0/77 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-01-09 21:16:48,314 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 4 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-09 21:16:48,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 156 flow [2025-01-09 21:16:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2025-01-09 21:16:48,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2025-01-09 21:16:48,316 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 146 flow. Second operand 3 states and 202 transitions. [2025-01-09 21:16:48,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 156 flow [2025-01-09 21:16:48,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:48,317 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 144 flow [2025-01-09 21:16:48,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-01-09 21:16:48,318 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2025-01-09 21:16:48,318 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 144 flow [2025-01-09 21:16:48,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:16:48,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:48,319 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] [2025-01-09 21:16:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:16:48,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:16:48,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1947324056, now seen corresponding path program 1 times [2025-01-09 21:16:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070788471] [2025-01-09 21:16:48,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:48,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:16:48,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:16:48,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:48,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:48,378 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:16:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070788471] [2025-01-09 21:16:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070788471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281919286] [2025-01-09 21:16:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:48,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:48,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:48,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:48,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 80 [2025-01-09 21:16:48,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:16:48,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:48,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 80 [2025-01-09 21:16:48,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:48,412 INFO L124 PetriNetUnfolderBase]: 0/76 cut-off events. [2025-01-09 21:16:48,413 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:16:48,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 76 events. 0/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-01-09 21:16:48,413 INFO L140 encePairwiseOnDemand]: 78/80 looper letters, 4 selfloop transitions, 1 changer transitions 5/67 dead transitions. [2025-01-09 21:16:48,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 152 flow [2025-01-09 21:16:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2025-01-09 21:16:48,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-01-09 21:16:48,419 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 144 flow. Second operand 3 states and 204 transitions. [2025-01-09 21:16:48,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 152 flow [2025-01-09 21:16:48,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:48,421 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 130 flow [2025-01-09 21:16:48,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-01-09 21:16:48,423 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2025-01-09 21:16:48,423 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 130 flow [2025-01-09 21:16:48,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:16:48,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:48,424 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:48,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:16:48,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:16:48,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 170390294, now seen corresponding path program 1 times [2025-01-09 21:16:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:48,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841758697] [2025-01-09 21:16:48,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:48,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:16:48,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:16:48,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:48,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:48,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:48,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:16:48,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:16:48,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:48,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:48,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:48,503 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:48,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-09 21:16:48,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-01-09 21:16:48,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-01-09 21:16:48,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-01-09 21:16:48,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:16:48,510 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:16:48,515 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:16:48,518 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:16:48,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:48,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 113 transitions, 236 flow [2025-01-09 21:16:48,566 INFO L124 PetriNetUnfolderBase]: 5/136 cut-off events. [2025-01-09 21:16:48,566 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:16:48,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 136 events. 5/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 239 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 90. Up to 3 conditions per place. [2025-01-09 21:16:48,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 113 transitions, 236 flow [2025-01-09 21:16:48,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 113 transitions, 236 flow [2025-01-09 21:16:48,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:48,572 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;@4e0b0b8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:48,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:16:48,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:48,575 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-01-09 21:16:48,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:48,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:48,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:48,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:16:48,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1211012350, now seen corresponding path program 1 times [2025-01-09 21:16:48,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:48,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802435302] [2025-01-09 21:16:48,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:48,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:48,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:16:48,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:16:48,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:48,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:48,614 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:16:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802435302] [2025-01-09 21:16:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802435302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759048829] [2025-01-09 21:16:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:48,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:48,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:48,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:48,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 113 [2025-01-09 21:16:48,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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:16:48,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:48,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 113 [2025-01-09 21:16:48,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:48,746 INFO L124 PetriNetUnfolderBase]: 39/377 cut-off events. [2025-01-09 21:16:48,747 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:16:48,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 377 events. 39/377 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1858 event pairs, 39 based on Foata normal form. 29/353 useless extension candidates. Maximal degree in co-relation 335. Up to 84 conditions per place. [2025-01-09 21:16:48,750 INFO L140 encePairwiseOnDemand]: 97/113 looper letters, 12 selfloop transitions, 2 changer transitions 1/95 dead transitions. [2025-01-09 21:16:48,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 228 flow [2025-01-09 21:16:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-01-09 21:16:48,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8171091445427728 [2025-01-09 21:16:48,751 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 236 flow. Second operand 3 states and 277 transitions. [2025-01-09 21:16:48,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 228 flow [2025-01-09 21:16:48,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:48,754 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 202 flow [2025-01-09 21:16:48,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-01-09 21:16:48,755 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -11 predicate places. [2025-01-09 21:16:48,755 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 202 flow [2025-01-09 21:16:48,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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:16:48,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:48,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:48,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:16:48,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:16:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1511755114, now seen corresponding path program 1 times [2025-01-09 21:16:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464139364] [2025-01-09 21:16:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:48,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:16:48,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:16:48,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:48,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:48,814 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:16:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464139364] [2025-01-09 21:16:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464139364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:48,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004616372] [2025-01-09 21:16:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:48,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:48,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:48,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:48,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:48,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2025-01-09 21:16:48,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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:16:48,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:48,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2025-01-09 21:16:48,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:48,903 INFO L124 PetriNetUnfolderBase]: 20/305 cut-off events. [2025-01-09 21:16:48,904 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:16:48,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 305 events. 20/305 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1291 event pairs, 7 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 360. Up to 30 conditions per place. [2025-01-09 21:16:48,909 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 16 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2025-01-09 21:16:48,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 103 transitions, 269 flow [2025-01-09 21:16:48,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-01-09 21:16:48,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2025-01-09 21:16:48,914 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 202 flow. Second operand 3 states and 279 transitions. [2025-01-09 21:16:48,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 103 transitions, 269 flow [2025-01-09 21:16:48,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:48,918 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 250 flow [2025-01-09 21:16:48,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2025-01-09 21:16:48,919 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -10 predicate places. [2025-01-09 21:16:48,919 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 250 flow [2025-01-09 21:16:48,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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:16:48,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:48,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:48,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:16:48,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:16:48,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:48,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1097705640, now seen corresponding path program 1 times [2025-01-09 21:16:48,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:48,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715397642] [2025-01-09 21:16:48,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:48,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:16:48,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:16:48,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:48,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:48,981 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:16:48,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:48,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715397642] [2025-01-09 21:16:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715397642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144269669] [2025-01-09 21:16:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:48,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:48,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:48,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:48,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2025-01-09 21:16:48,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:16:48,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:48,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2025-01-09 21:16:48,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:49,072 INFO L124 PetriNetUnfolderBase]: 36/418 cut-off events. [2025-01-09 21:16:49,072 INFO L125 PetriNetUnfolderBase]: For 86/90 co-relation queries the response was YES. [2025-01-09 21:16:49,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 418 events. 36/418 cut-off events. For 86/90 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2273 event pairs, 9 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 512. Up to 66 conditions per place. [2025-01-09 21:16:49,076 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 17 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-01-09 21:16:49,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 109 transitions, 327 flow [2025-01-09 21:16:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-01-09 21:16:49,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289085545722714 [2025-01-09 21:16:49,078 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 250 flow. Second operand 3 states and 281 transitions. [2025-01-09 21:16:49,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 109 transitions, 327 flow [2025-01-09 21:16:49,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 109 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:49,083 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 290 flow [2025-01-09 21:16:49,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=105, PETRI_TRANSITIONS=106} [2025-01-09 21:16:49,085 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -8 predicate places. [2025-01-09 21:16:49,086 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 290 flow [2025-01-09 21:16:49,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:16:49,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:49,087 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:49,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:16:49,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:16:49,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash -265973317, now seen corresponding path program 1 times [2025-01-09 21:16:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:49,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308852896] [2025-01-09 21:16:49,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:49,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:49,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:16:49,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:16:49,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:49,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:49,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:49,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:16:49,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:16:49,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:49,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:49,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:49,137 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:49,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-01-09 21:16:49,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-01-09 21:16:49,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-01-09 21:16:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:16:49,140 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:16:49,141 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:16:49,141 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:16:49,166 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:49,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 146 transitions, 310 flow [2025-01-09 21:16:49,192 INFO L124 PetriNetUnfolderBase]: 7/183 cut-off events. [2025-01-09 21:16:49,195 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:16:49,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 183 events. 7/183 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 387 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 140. Up to 4 conditions per place. [2025-01-09 21:16:49,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 146 transitions, 310 flow [2025-01-09 21:16:49,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 146 transitions, 310 flow [2025-01-09 21:16:49,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:49,199 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;@4e0b0b8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:49,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:16:49,201 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:49,202 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-01-09 21:16:49,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:49,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:49,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:49,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:16:49,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1637088368, now seen corresponding path program 1 times [2025-01-09 21:16:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:49,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114216263] [2025-01-09 21:16:49,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:49,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:49,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:16:49,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:16:49,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:49,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:49,229 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:16:49,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114216263] [2025-01-09 21:16:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114216263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:49,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632893870] [2025-01-09 21:16:49,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:49,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:49,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:49,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:49,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:49,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 146 [2025-01-09 21:16:49,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 146 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:16:49,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:49,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 146 [2025-01-09 21:16:49,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:49,495 INFO L124 PetriNetUnfolderBase]: 279/1558 cut-off events. [2025-01-09 21:16:49,495 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 21:16:49,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2094 conditions, 1558 events. 279/1558 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12708 event pairs, 279 based on Foata normal form. 163/1494 useless extension candidates. Maximal degree in co-relation 1521. Up to 452 conditions per place. [2025-01-09 21:16:49,506 INFO L140 encePairwiseOnDemand]: 124/146 looper letters, 16 selfloop transitions, 2 changer transitions 1/120 dead transitions. [2025-01-09 21:16:49,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 120 transitions, 294 flow [2025-01-09 21:16:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2025-01-09 21:16:49,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8059360730593608 [2025-01-09 21:16:49,508 INFO L175 Difference]: Start difference. First operand has 146 places, 146 transitions, 310 flow. Second operand 3 states and 353 transitions. [2025-01-09 21:16:49,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 120 transitions, 294 flow [2025-01-09 21:16:49,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 120 transitions, 292 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:49,511 INFO L231 Difference]: Finished difference. Result has 129 places, 119 transitions, 258 flow [2025-01-09 21:16:49,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=129, PETRI_TRANSITIONS=119} [2025-01-09 21:16:49,512 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, -17 predicate places. [2025-01-09 21:16:49,512 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 119 transitions, 258 flow [2025-01-09 21:16:49,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:16:49,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:49,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:49,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:16:49,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:16:49,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1918589878, now seen corresponding path program 1 times [2025-01-09 21:16:49,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586530035] [2025-01-09 21:16:49,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:49,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:49,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:16:49,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:16:49,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:49,552 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:16:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586530035] [2025-01-09 21:16:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586530035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:49,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:49,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916582668] [2025-01-09 21:16:49,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:49,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:49,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:49,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:49,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 146 [2025-01-09 21:16:49,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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:16:49,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:49,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 146 [2025-01-09 21:16:49,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:49,804 INFO L124 PetriNetUnfolderBase]: 289/1758 cut-off events. [2025-01-09 21:16:49,805 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-01-09 21:16:49,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2411 conditions, 1758 events. 289/1758 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14722 event pairs, 98 based on Foata normal form. 0/1537 useless extension candidates. Maximal degree in co-relation 2384. Up to 301 conditions per place. [2025-01-09 21:16:49,822 INFO L140 encePairwiseOnDemand]: 134/146 looper letters, 24 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2025-01-09 21:16:49,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 133 transitions, 362 flow [2025-01-09 21:16:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-01-09 21:16:49,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8013698630136986 [2025-01-09 21:16:49,826 INFO L175 Difference]: Start difference. First operand has 129 places, 119 transitions, 258 flow. Second operand 3 states and 351 transitions. [2025-01-09 21:16:49,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 133 transitions, 362 flow [2025-01-09 21:16:49,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 133 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:49,829 INFO L231 Difference]: Finished difference. Result has 130 places, 128 transitions, 332 flow [2025-01-09 21:16:49,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=130, PETRI_TRANSITIONS=128} [2025-01-09 21:16:49,832 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, -16 predicate places. [2025-01-09 21:16:49,832 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 128 transitions, 332 flow [2025-01-09 21:16:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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:16:49,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:49,836 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] [2025-01-09 21:16:49,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:16:49,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:16:49,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1223919288, now seen corresponding path program 1 times [2025-01-09 21:16:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790103125] [2025-01-09 21:16:49,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:49,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:16:49,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:16:49,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:49,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:49,876 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:16:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790103125] [2025-01-09 21:16:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790103125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:49,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:49,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758253540] [2025-01-09 21:16:49,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:49,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:49,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:49,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:49,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 146 [2025-01-09 21:16:49,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 128 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:16:49,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:49,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 146 [2025-01-09 21:16:49,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:50,455 INFO L124 PetriNetUnfolderBase]: 938/4557 cut-off events. [2025-01-09 21:16:50,456 INFO L125 PetriNetUnfolderBase]: For 1290/1382 co-relation queries the response was YES. [2025-01-09 21:16:50,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 4557 events. 938/4557 cut-off events. For 1290/1382 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49845 event pairs, 236 based on Foata normal form. 1/4085 useless extension candidates. Maximal degree in co-relation 7576. Up to 972 conditions per place. [2025-01-09 21:16:50,502 INFO L140 encePairwiseOnDemand]: 134/146 looper letters, 29 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2025-01-09 21:16:50,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 470 flow [2025-01-09 21:16:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2025-01-09 21:16:50,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8059360730593608 [2025-01-09 21:16:50,504 INFO L175 Difference]: Start difference. First operand has 130 places, 128 transitions, 332 flow. Second operand 3 states and 353 transitions. [2025-01-09 21:16:50,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 470 flow [2025-01-09 21:16:50,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 145 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:50,515 INFO L231 Difference]: Finished difference. Result has 132 places, 137 transitions, 392 flow [2025-01-09 21:16:50,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=132, PETRI_TRANSITIONS=137} [2025-01-09 21:16:50,516 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, -14 predicate places. [2025-01-09 21:16:50,516 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 392 flow [2025-01-09 21:16:50,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:16:50,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:50,517 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:50,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:16:50,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:16:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1803638513, now seen corresponding path program 1 times [2025-01-09 21:16:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894711505] [2025-01-09 21:16:50,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:50,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:16:50,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:16:50,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:50,532 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:50,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:16:50,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:16:50,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:50,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:50,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:50,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:50,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thrErr3ASSERT_VIOLATIONDATA_RACE (25 of 26 remaining) [2025-01-09 21:16:50,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-01-09 21:16:50,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 26 remaining) [2025-01-09 21:16:50,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-01-09 21:16:50,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-01-09 21:16:50,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-01-09 21:16:50,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-01-09 21:16:50,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-01-09 21:16:50,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-01-09 21:16:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:16:50,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:16:50,599 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2025-01-09 21:16:50,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:16:50,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:16:50 BasicIcfg [2025-01-09 21:16:50,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:16:50,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:16:50,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:16:50,609 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:16:50,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:16:47" (3/4) ... [2025-01-09 21:16:50,611 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:16:50,670 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 21:16:50,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:16:50,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:16:50,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:16:50,718 INFO L158 Benchmark]: Toolchain (without parser) took 3833.37ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 110.7MB in the beginning and 161.1MB in the end (delta: -50.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2025-01-09 21:16:50,719 INFO L158 Benchmark]: CDTParser took 1.74ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:16:50,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.54ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 90.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:16:50,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:16:50,719 INFO L158 Benchmark]: Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 88.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:16:50,720 INFO L158 Benchmark]: RCFGBuilder took 330.17ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 73.3MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:16:50,720 INFO L158 Benchmark]: TraceAbstraction took 2970.09ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 72.4MB in the beginning and 174.3MB in the end (delta: -101.9MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2025-01-09 21:16:50,720 INFO L158 Benchmark]: Witness Printer took 108.95ms. Allocated memory is still 209.7MB. Free memory was 174.3MB in the beginning and 161.1MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:16:50,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.74ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.54ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 90.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 88.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 330.17ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 73.3MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2970.09ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 72.4MB in the beginning and 174.3MB in the end (delta: -101.9MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. * Witness Printer took 108.95ms. Allocated memory is still 209.7MB. Free memory was 174.3MB in the beginning and 161.1MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 711]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int s; VAL [s=0] [L698] 0 volatile int t; VAL [s=0, t=0] [L716] 0 pthread_t t; VAL [s=0, t=0] [L717] 0 int i, n; VAL [s=0, t=0] [L718] 0 s = 0 VAL [s=0, t=0] [L719] 0 n = __VERIFIER_nondet_int() VAL [n=2, s=0, t=0] [L720] CALL 0 assume_abort_if_not(n > 0) [L686] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, s=0, t=0] [L720] RET 0 assume_abort_if_not(n > 0) [L721] 0 i = 0 VAL [i=0, n=2, s=0, t=0] [L721] COND TRUE 0 i < n VAL [i=0, n=2, s=0, t=0] [L722] FCALL, FORK 0 pthread_create(&t, 0, thr, 0) VAL [i=0, n=2, s=0, t=-1, t=0] [L721] 0 i++ VAL [i=1, n=2, s=0, t=-1, t=0] [L721] COND TRUE 0 i < n VAL [i=1, n=2, s=0, t=-1, t=0] [L722] FCALL, FORK 0 pthread_create(&t, 0, thr, 0) VAL [i=1, n=2, s=0, t=0, t=0] [L710] CALL 2 inct() [L710] CALL 1 inct() [L701] 1 t++ VAL [s=0, t=1] [L710] RET 1 inct() [L711] 1 s < t VAL [\old(arg)={0:0}, arg={0:0}, s=0, t=1] [L701] 2 t++ VAL [s=0, t=2] [L711] 1 s < t VAL [\old(arg)={0:0}, arg={0:0}, s=0, t=2] Now there is a data race on ~t~0 between C: t++ [701] and C: s < t [711] - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 109 locations, 14 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: 0.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 3 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, InterpolantAutomatonStates: 9, 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.2s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 140 locations, 20 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: 0.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 21 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=3, InterpolantAutomatonStates: 9, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 171 locations, 26 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.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 13 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=3, InterpolantAutomatonStates: 9, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:16:50,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)