./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.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-atomic/lamport.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 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:03:38,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:03:38,944 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:03:38,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:03:38,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:03:38,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:03:38,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:03:38,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:03:38,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:03:38,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:03:38,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:03:38,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:03:38,972 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:03:38,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:03:38,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:03:38,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:03:38,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:03:38,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:03:38,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:38,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:38,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:38,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:03:38,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:03:38,977 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 -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2025-01-09 21:03:39,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:03:39,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:03:39,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:03:39,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:03:39,236 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:03:39,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2025-01-09 21:03:40,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6be20e17/2e6130bf1fed40e1ba8ed32e8dd23aa9/FLAG350eedceb [2025-01-09 21:03:40,685 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:03:40,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2025-01-09 21:03:40,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6be20e17/2e6130bf1fed40e1ba8ed32e8dd23aa9/FLAG350eedceb [2025-01-09 21:03:40,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6be20e17/2e6130bf1fed40e1ba8ed32e8dd23aa9 [2025-01-09 21:03:40,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:03:41,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:03:41,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:41,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:03:41,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:03:41,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:40" (1/1) ... [2025-01-09 21:03:41,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e26fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41, skipping insertion in model container [2025-01-09 21:03:41,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:40" (1/1) ... [2025-01-09 21:03:41,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:03:41,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:41,294 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:03:41,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:41,358 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:03:41,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41 WrapperNode [2025-01-09 21:03:41,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:41,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:41,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:03:41,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:03:41,364 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:03:41" (1/1) ... [2025-01-09 21:03:41,371 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:03:41" (1/1) ... [2025-01-09 21:03:41,385 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-01-09 21:03:41,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:41,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:03:41,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:03:41,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:03:41,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:03:41,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:03:41,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:03:41,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:03:41,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:41,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:03:41,438 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:03:41,442 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:03:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-09 21:03:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-09 21:03:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:03:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:03:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:03:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:03:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:03:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:03:41,460 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:03:41,545 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:03:41,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:03:41,660 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:03:41,660 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:03:41,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:03:41,667 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:03:41,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:41 BoogieIcfgContainer [2025-01-09 21:03:41,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:03:41,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:03:41,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:03:41,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:03:41,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:03:40" (1/3) ... [2025-01-09 21:03:41,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aeb6a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:41, skipping insertion in model container [2025-01-09 21:03:41,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41" (2/3) ... [2025-01-09 21:03:41,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aeb6a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:41, skipping insertion in model container [2025-01-09 21:03:41,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:41" (3/3) ... [2025-01-09 21:03:41,674 INFO L128 eAbstractionObserver]: Analyzing ICFG lamport.i [2025-01-09 21:03:41,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:03:41,686 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lamport.i that has 3 procedures, 98 locations, 1 initial locations, 8 loop locations, and 4 error locations. [2025-01-09 21:03:41,687 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:03:41,731 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:03:41,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 115 transitions, 244 flow [2025-01-09 21:03:41,790 INFO L124 PetriNetUnfolderBase]: 18/113 cut-off events. [2025-01-09 21:03:41,792 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:03:41,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 18/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 90. Up to 3 conditions per place. [2025-01-09 21:03:41,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 115 transitions, 244 flow [2025-01-09 21:03:41,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 108 transitions, 225 flow [2025-01-09 21:03:41,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:03:41,813 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;@4039aab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:03:41,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:03:41,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:03:41,826 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-01-09 21:03:41,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:03:41,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:41,826 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] [2025-01-09 21:03:41,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2126873070, now seen corresponding path program 1 times [2025-01-09 21:03:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:41,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645991611] [2025-01-09 21:03:41,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:41,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:03:41,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:03:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:41,973 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:03:41,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:41,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645991611] [2025-01-09 21:03:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645991611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:41,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901539220] [2025-01-09 21:03:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:41,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:03:41,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:41,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:03:41,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:03:42,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 115 [2025-01-09 21:03:42,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 225 flow. Second operand has 2 states, 2 states have (on average 106.0) internal successors, (212), 2 states have internal predecessors, (212), 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:03:42,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 115 [2025-01-09 21:03:42,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:42,034 INFO L124 PetriNetUnfolderBase]: 12/100 cut-off events. [2025-01-09 21:03:42,034 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:03:42,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 100 events. 12/100 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 156 event pairs, 0 based on Foata normal form. 10/92 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2025-01-09 21:03:42,037 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 3 selfloop transitions, 0 changer transitions 0/100 dead transitions. [2025-01-09 21:03:42,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 100 transitions, 215 flow [2025-01-09 21:03:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:03:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:03:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 219 transitions. [2025-01-09 21:03:42,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9521739130434783 [2025-01-09 21:03:42,050 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 225 flow. Second operand 2 states and 219 transitions. [2025-01-09 21:03:42,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 100 transitions, 215 flow [2025-01-09 21:03:42,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:03:42,055 INFO L231 Difference]: Finished difference. Result has 93 places, 100 transitions, 204 flow [2025-01-09 21:03:42,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=204, PETRI_PLACES=93, PETRI_TRANSITIONS=100} [2025-01-09 21:03:42,060 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, -4 predicate places. [2025-01-09 21:03:42,061 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 100 transitions, 204 flow [2025-01-09 21:03:42,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.0) internal successors, (212), 2 states have internal predecessors, (212), 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:03:42,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,061 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] [2025-01-09 21:03:42,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:03:42,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:42,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash 525636699, now seen corresponding path program 1 times [2025-01-09 21:03:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341699583] [2025-01-09 21:03:42,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:42,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:03:42,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:03:42,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:42,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:42,119 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:03:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341699583] [2025-01-09 21:03:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341699583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:42,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:42,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012116326] [2025-01-09 21:03:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:42,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:42,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:42,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:42,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 115 [2025-01-09 21:03:42,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 100 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:03:42,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 115 [2025-01-09 21:03:42,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:42,193 INFO L124 PetriNetUnfolderBase]: 38/234 cut-off events. [2025-01-09 21:03:42,194 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:03:42,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 234 events. 38/234 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 908 event pairs, 11 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 300. Up to 42 conditions per place. [2025-01-09 21:03:42,199 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 11 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-01-09 21:03:42,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 105 transitions, 248 flow [2025-01-09 21:03:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2025-01-09 21:03:42,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2025-01-09 21:03:42,203 INFO L175 Difference]: Start difference. First operand has 93 places, 100 transitions, 204 flow. Second operand 3 states and 308 transitions. [2025-01-09 21:03:42,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 105 transitions, 248 flow [2025-01-09 21:03:42,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 105 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:03:42,210 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 242 flow [2025-01-09 21:03:42,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2025-01-09 21:03:42,211 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2025-01-09 21:03:42,211 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 242 flow [2025-01-09 21:03:42,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:03:42,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,212 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] [2025-01-09 21:03:42,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:03:42,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:42,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash -207479832, now seen corresponding path program 1 times [2025-01-09 21:03:42,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098454075] [2025-01-09 21:03:42,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:42,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:03:42,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:03:42,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:42,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:42,282 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:03:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:42,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098454075] [2025-01-09 21:03:42,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098454075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:42,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:42,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409729464] [2025-01-09 21:03:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:42,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:42,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:42,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:42,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 115 [2025-01-09 21:03:42,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:03:42,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 115 [2025-01-09 21:03:42,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:42,359 INFO L124 PetriNetUnfolderBase]: 43/302 cut-off events. [2025-01-09 21:03:42,360 INFO L125 PetriNetUnfolderBase]: For 43/47 co-relation queries the response was YES. [2025-01-09 21:03:42,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 302 events. 43/302 cut-off events. For 43/47 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1331 event pairs, 6 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 432. Up to 46 conditions per place. [2025-01-09 21:03:42,364 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 12 selfloop transitions, 6 changer transitions 3/112 dead transitions. [2025-01-09 21:03:42,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 311 flow [2025-01-09 21:03:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2025-01-09 21:03:42,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9043478260869565 [2025-01-09 21:03:42,365 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 242 flow. Second operand 3 states and 312 transitions. [2025-01-09 21:03:42,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 311 flow [2025-01-09 21:03:42,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 112 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:42,368 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 278 flow [2025-01-09 21:03:42,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2025-01-09 21:03:42,369 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places. [2025-01-09 21:03:42,369 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 278 flow [2025-01-09 21:03:42,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:03:42,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:42,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:03:42,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:42,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -830766962, now seen corresponding path program 1 times [2025-01-09 21:03:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159282501] [2025-01-09 21:03:42,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:42,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:03:42,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:03:42,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:42,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159282501] [2025-01-09 21:03:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159282501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:42,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:42,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224536158] [2025-01-09 21:03:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:42,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:42,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:42,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:42,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 115 [2025-01-09 21:03:42,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:42,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 115 [2025-01-09 21:03:42,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:42,483 INFO L124 PetriNetUnfolderBase]: 61/349 cut-off events. [2025-01-09 21:03:42,483 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-01-09 21:03:42,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 349 events. 61/349 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1806 event pairs, 12 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 579. Up to 68 conditions per place. [2025-01-09 21:03:42,485 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 7 changer transitions 2/112 dead transitions. [2025-01-09 21:03:42,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 112 transitions, 337 flow [2025-01-09 21:03:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2025-01-09 21:03:42,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2025-01-09 21:03:42,487 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 278 flow. Second operand 3 states and 308 transitions. [2025-01-09 21:03:42,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 112 transitions, 337 flow [2025-01-09 21:03:42,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:42,491 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 314 flow [2025-01-09 21:03:42,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2025-01-09 21:03:42,491 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places. [2025-01-09 21:03:42,491 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 314 flow [2025-01-09 21:03:42,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:42,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:42,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:03:42,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:42,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash -520733477, now seen corresponding path program 1 times [2025-01-09 21:03:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349607365] [2025-01-09 21:03:42,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:42,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:03:42,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:03:42,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:42,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:42,568 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:03:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:42,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349607365] [2025-01-09 21:03:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349607365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:42,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021804440] [2025-01-09 21:03:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:42,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:42,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:42,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:42,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2025-01-09 21:03:42,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:03:42,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2025-01-09 21:03:42,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:42,657 INFO L124 PetriNetUnfolderBase]: 157/725 cut-off events. [2025-01-09 21:03:42,658 INFO L125 PetriNetUnfolderBase]: For 192/196 co-relation queries the response was YES. [2025-01-09 21:03:42,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 725 events. 157/725 cut-off events. For 192/196 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4716 event pairs, 23 based on Foata normal form. 6/649 useless extension candidates. Maximal degree in co-relation 1264. Up to 127 conditions per place. [2025-01-09 21:03:42,662 INFO L140 encePairwiseOnDemand]: 105/115 looper letters, 17 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-01-09 21:03:42,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 115 transitions, 370 flow [2025-01-09 21:03:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-01-09 21:03:42,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2025-01-09 21:03:42,664 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 314 flow. Second operand 3 states and 300 transitions. [2025-01-09 21:03:42,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 115 transitions, 370 flow [2025-01-09 21:03:42,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 115 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:42,669 INFO L231 Difference]: Finished difference. Result has 103 places, 114 transitions, 346 flow [2025-01-09 21:03:42,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=103, PETRI_TRANSITIONS=114} [2025-01-09 21:03:42,669 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 6 predicate places. [2025-01-09 21:03:42,670 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 114 transitions, 346 flow [2025-01-09 21:03:42,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:03:42,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:42,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:03:42,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:42,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash -983437093, now seen corresponding path program 2 times [2025-01-09 21:03:42,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679652498] [2025-01-09 21:03:42,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:03:42,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:42,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:03:42,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:03:42,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:03:42,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:42,725 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:03:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679652498] [2025-01-09 21:03:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679652498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685897224] [2025-01-09 21:03:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:42,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:42,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:42,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-01-09 21:03:42,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 114 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:03:42,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-01-09 21:03:42,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:42,826 INFO L124 PetriNetUnfolderBase]: 241/1236 cut-off events. [2025-01-09 21:03:42,826 INFO L125 PetriNetUnfolderBase]: For 307/331 co-relation queries the response was YES. [2025-01-09 21:03:42,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 1236 events. 241/1236 cut-off events. For 307/331 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10091 event pairs, 20 based on Foata normal form. 7/1094 useless extension candidates. Maximal degree in co-relation 2190. Up to 170 conditions per place. [2025-01-09 21:03:42,831 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 11 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-01-09 21:03:42,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 119 transitions, 387 flow [2025-01-09 21:03:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2025-01-09 21:03:42,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9072463768115943 [2025-01-09 21:03:42,832 INFO L175 Difference]: Start difference. First operand has 103 places, 114 transitions, 346 flow. Second operand 3 states and 313 transitions. [2025-01-09 21:03:42,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 119 transitions, 387 flow [2025-01-09 21:03:42,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 119 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:42,837 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 364 flow [2025-01-09 21:03:42,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2025-01-09 21:03:42,838 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 8 predicate places. [2025-01-09 21:03:42,838 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 364 flow [2025-01-09 21:03:42,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:03:42,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:42,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:03:42,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:42,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash -331747799, now seen corresponding path program 3 times [2025-01-09 21:03:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428866172] [2025-01-09 21:03:42,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:03:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:42,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:03:42,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:03:42,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:03:42,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:42,877 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:03:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:42,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428866172] [2025-01-09 21:03:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428866172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:42,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821459616] [2025-01-09 21:03:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:42,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:42,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:42,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:42,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2025-01-09 21:03:42,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:03:42,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2025-01-09 21:03:42,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,028 INFO L124 PetriNetUnfolderBase]: 254/1335 cut-off events. [2025-01-09 21:03:43,028 INFO L125 PetriNetUnfolderBase]: For 430/484 co-relation queries the response was YES. [2025-01-09 21:03:43,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 1335 events. 254/1335 cut-off events. For 430/484 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11193 event pairs, 39 based on Foata normal form. 35/1232 useless extension candidates. Maximal degree in co-relation 2512. Up to 187 conditions per place. [2025-01-09 21:03:43,032 INFO L140 encePairwiseOnDemand]: 105/115 looper letters, 14 selfloop transitions, 5 changer transitions 7/122 dead transitions. [2025-01-09 21:03:43,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 122 transitions, 435 flow [2025-01-09 21:03:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-01-09 21:03:43,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2025-01-09 21:03:43,034 INFO L175 Difference]: Start difference. First operand has 105 places, 117 transitions, 364 flow. Second operand 3 states and 300 transitions. [2025-01-09 21:03:43,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 122 transitions, 435 flow [2025-01-09 21:03:43,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 122 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:43,036 INFO L231 Difference]: Finished difference. Result has 107 places, 115 transitions, 382 flow [2025-01-09 21:03:43,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=107, PETRI_TRANSITIONS=115} [2025-01-09 21:03:43,037 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 10 predicate places. [2025-01-09 21:03:43,037 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 382 flow [2025-01-09 21:03:43,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:03:43,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:43,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:03:43,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:43,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,038 INFO L85 PathProgramCache]: Analyzing trace with hash -861543055, now seen corresponding path program 4 times [2025-01-09 21:03:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066599326] [2025-01-09 21:03:43,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:03:43,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,046 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-01-09 21:03:43,052 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 46 statements. [2025-01-09 21:03:43,052 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:03:43,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,074 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:03:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066599326] [2025-01-09 21:03:43,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066599326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094261793] [2025-01-09 21:03:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-01-09 21:03:43,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:03:43,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-01-09 21:03:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,203 INFO L124 PetriNetUnfolderBase]: 185/1238 cut-off events. [2025-01-09 21:03:43,203 INFO L125 PetriNetUnfolderBase]: For 459/493 co-relation queries the response was YES. [2025-01-09 21:03:43,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 1238 events. 185/1238 cut-off events. For 459/493 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10513 event pairs, 26 based on Foata normal form. 17/1126 useless extension candidates. Maximal degree in co-relation 2325. Up to 184 conditions per place. [2025-01-09 21:03:43,209 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 11 selfloop transitions, 3 changer transitions 2/117 dead transitions. [2025-01-09 21:03:43,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 117 transitions, 417 flow [2025-01-09 21:03:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-01-09 21:03:43,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9014492753623189 [2025-01-09 21:03:43,211 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 382 flow. Second operand 3 states and 311 transitions. [2025-01-09 21:03:43,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 117 transitions, 417 flow [2025-01-09 21:03:43,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 117 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:43,215 INFO L231 Difference]: Finished difference. Result has 109 places, 114 transitions, 388 flow [2025-01-09 21:03:43,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=109, PETRI_TRANSITIONS=114} [2025-01-09 21:03:43,215 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2025-01-09 21:03:43,216 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 114 transitions, 388 flow [2025-01-09 21:03:43,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:03:43,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:43,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:03:43,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:43,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1705638913, now seen corresponding path program 1 times [2025-01-09 21:03:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903747799] [2025-01-09 21:03:43,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:03:43,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:03:43,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:43,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903747799] [2025-01-09 21:03:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903747799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898026163] [2025-01-09 21:03:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-01-09 21:03:43,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 114 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:03:43,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-01-09 21:03:43,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,350 INFO L124 PetriNetUnfolderBase]: 126/883 cut-off events. [2025-01-09 21:03:43,350 INFO L125 PetriNetUnfolderBase]: For 251/284 co-relation queries the response was YES. [2025-01-09 21:03:43,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 883 events. 126/883 cut-off events. For 251/284 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6631 event pairs, 15 based on Foata normal form. 7/811 useless extension candidates. Maximal degree in co-relation 1620. Up to 112 conditions per place. [2025-01-09 21:03:43,354 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 6 selfloop transitions, 4 changer transitions 1/116 dead transitions. [2025-01-09 21:03:43,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 116 transitions, 415 flow [2025-01-09 21:03:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-01-09 21:03:43,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2025-01-09 21:03:43,356 INFO L175 Difference]: Start difference. First operand has 109 places, 114 transitions, 388 flow. Second operand 3 states and 309 transitions. [2025-01-09 21:03:43,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 116 transitions, 415 flow [2025-01-09 21:03:43,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 116 transitions, 403 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:43,361 INFO L231 Difference]: Finished difference. Result has 109 places, 115 transitions, 394 flow [2025-01-09 21:03:43,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=109, PETRI_TRANSITIONS=115} [2025-01-09 21:03:43,361 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2025-01-09 21:03:43,362 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 115 transitions, 394 flow [2025-01-09 21:03:43,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:03:43,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:03:43,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:03:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 697859495, now seen corresponding path program 1 times [2025-01-09 21:03:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532967743] [2025-01-09 21:03:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:03:43,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:03:43,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,407 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:03:43,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532967743] [2025-01-09 21:03:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532967743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716356604] [2025-01-09 21:03:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-01-09 21:03:43,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 115 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:03:43,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-01-09 21:03:43,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,453 INFO L124 PetriNetUnfolderBase]: 59/549 cut-off events. [2025-01-09 21:03:43,454 INFO L125 PetriNetUnfolderBase]: For 116/125 co-relation queries the response was YES. [2025-01-09 21:03:43,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 549 events. 59/549 cut-off events. For 116/125 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3378 event pairs, 12 based on Foata normal form. 6/527 useless extension candidates. Maximal degree in co-relation 1004. Up to 44 conditions per place. [2025-01-09 21:03:43,455 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 0 selfloop transitions, 0 changer transitions 105/105 dead transitions. [2025-01-09 21:03:43,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 364 flow [2025-01-09 21:03:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-01-09 21:03:43,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2025-01-09 21:03:43,457 INFO L175 Difference]: Start difference. First operand has 109 places, 115 transitions, 394 flow. Second operand 3 states and 309 transitions. [2025-01-09 21:03:43,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 364 flow [2025-01-09 21:03:43,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 330 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-09 21:03:43,459 INFO L231 Difference]: Finished difference. Result has 102 places, 0 transitions, 0 flow [2025-01-09 21:03:43,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=102, PETRI_TRANSITIONS=0} [2025-01-09 21:03:43,460 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 5 predicate places. [2025-01-09 21:03:43,460 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 0 transitions, 0 flow [2025-01-09 21:03:43,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:03:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-01-09 21:03:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:03:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:03:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:03:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2025-01-09 21:03:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2025-01-09 21:03:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-01-09 21:03:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:03:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:03:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:03:43,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:03:43,463 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:43,467 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:03:43,467 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:03:43,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:03:43 BasicIcfg [2025-01-09 21:03:43,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:03:43,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:03:43,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:03:43,475 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:03:43,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:41" (3/4) ... [2025-01-09 21:03:43,477 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:03:43,479 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-01-09 21:03:43,479 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-01-09 21:03:43,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-09 21:03:43,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:03:43,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:03:43,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:03:43,573 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:03:43,574 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:03:43,574 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:03:43,574 INFO L158 Benchmark]: Toolchain (without parser) took 2574.52ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 86.5MB in the end (delta: 34.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-01-09 21:03:43,574 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:43,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.46ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 101.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:03:43,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.19ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 99.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:03:43,575 INFO L158 Benchmark]: Boogie Preprocessor took 18.68ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 98.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:43,575 INFO L158 Benchmark]: RCFGBuilder took 262.05ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 83.7MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:03:43,575 INFO L158 Benchmark]: TraceAbstraction took 1805.66ms. Allocated memory is still 167.8MB. Free memory was 83.4MB in the beginning and 91.7MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:43,575 INFO L158 Benchmark]: Witness Printer took 98.62ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 86.5MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:43,576 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.46ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 101.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.19ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 99.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.68ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 98.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 262.05ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 83.7MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1805.66ms. Allocated memory is still 167.8MB. Free memory was 83.4MB in the beginning and 91.7MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 98.62ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 86.5MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 780]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 781]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 754]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 755]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 164 locations, 10 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.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 36 mSDtfsCounter, 210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=394occurred in iteration=9, InterpolantAutomatonStates: 29, 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.4s InterpolantComputationTime, 406 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:03:43,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE