./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:11,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:11,554 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:32:11,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:11,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:11,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:11,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:11,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:11,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:11,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:11,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:11,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:11,583 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:11,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:11,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:11,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:11,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:11,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:11,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:11,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:11,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:11,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:11,585 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2025-01-09 21:32:11,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:11,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:11,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:11,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:11,802 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:11,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-01-09 21:32:12,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90bc6cf18/ea227da4a678416087427e8418ec92f9/FLAG5eb0c57aa [2025-01-09 21:32:13,200 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:13,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-01-09 21:32:13,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90bc6cf18/ea227da4a678416087427e8418ec92f9/FLAG5eb0c57aa [2025-01-09 21:32:13,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90bc6cf18/ea227da4a678416087427e8418ec92f9 [2025-01-09 21:32:13,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:13,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:13,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:13,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:13,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:13,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39350d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13, skipping insertion in model container [2025-01-09 21:32:13,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:13,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:13,700 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:13,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:13,731 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:13,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13 WrapperNode [2025-01-09 21:32:13,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:13,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:13,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:13,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:13,738 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:32:13" (1/1) ... [2025-01-09 21:32:13,742 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:32:13" (1/1) ... [2025-01-09 21:32:13,753 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-01-09 21:32:13,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:13,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:13,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:13,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:13,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:13,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:13,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:13,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:13,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (1/1) ... [2025-01-09 21:32:13,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:13,811 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:32:13,813 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:32:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:13,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:13,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:13,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:13,831 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:32:13,898 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:13,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:14,158 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:14,159 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:14,171 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:14,171 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:32:14,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:14 BoogieIcfgContainer [2025-01-09 21:32:14,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:14,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:14,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:14,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:14,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:13" (1/3) ... [2025-01-09 21:32:14,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9aca9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:14, skipping insertion in model container [2025-01-09 21:32:14,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:13" (2/3) ... [2025-01-09 21:32:14,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9aca9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:14, skipping insertion in model container [2025-01-09 21:32:14,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:14" (3/3) ... [2025-01-09 21:32:14,178 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-01-09 21:32:14,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:14,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 184 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-01-09 21:32:14,188 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:14,238 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:32:14,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 192 transitions, 398 flow [2025-01-09 21:32:14,303 INFO L124 PetriNetUnfolderBase]: 9/190 cut-off events. [2025-01-09 21:32:14,305 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:32:14,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 190 events. 9/190 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 271 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2025-01-09 21:32:14,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 192 transitions, 398 flow [2025-01-09 21:32:14,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 173 transitions, 355 flow [2025-01-09 21:32:14,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:14,324 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;@3a6ba16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:14,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 21:32:14,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:14,331 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:32:14,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:14,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:14,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:14,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:14,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1149660300, now seen corresponding path program 1 times [2025-01-09 21:32:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605440937] [2025-01-09 21:32:14,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:14,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:32:14,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:32:14,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:14,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:14,460 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:32:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605440937] [2025-01-09 21:32:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605440937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442143738] [2025-01-09 21:32:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:14,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:14,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:14,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:14,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 192 [2025-01-09 21:32:14,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 173 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:32:14,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:14,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 192 [2025-01-09 21:32:14,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:14,609 INFO L124 PetriNetUnfolderBase]: 12/214 cut-off events. [2025-01-09 21:32:14,611 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:14,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 214 events. 12/214 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs, 5 based on Foata normal form. 8/186 useless extension candidates. Maximal degree in co-relation 160. Up to 24 conditions per place. [2025-01-09 21:32:14,615 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 12 selfloop transitions, 2 changer transitions 1/169 dead transitions. [2025-01-09 21:32:14,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 169 transitions, 375 flow [2025-01-09 21:32:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2025-01-09 21:32:14,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:32:14,626 INFO L175 Difference]: Start difference. First operand has 172 places, 173 transitions, 355 flow. Second operand 3 states and 528 transitions. [2025-01-09 21:32:14,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 169 transitions, 375 flow [2025-01-09 21:32:14,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 169 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:32:14,632 INFO L231 Difference]: Finished difference. Result has 170 places, 168 transitions, 344 flow [2025-01-09 21:32:14,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=170, PETRI_TRANSITIONS=168} [2025-01-09 21:32:14,635 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -2 predicate places. [2025-01-09 21:32:14,636 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 168 transitions, 344 flow [2025-01-09 21:32:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:32:14,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:14,636 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] [2025-01-09 21:32:14,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:14,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1056330807, now seen corresponding path program 1 times [2025-01-09 21:32:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051572493] [2025-01-09 21:32:14,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:14,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:32:14,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:32:14,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:14,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:14,682 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:32:14,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051572493] [2025-01-09 21:32:14,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051572493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:14,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:14,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569274489] [2025-01-09 21:32:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:14,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:14,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:14,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:14,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 192 [2025-01-09 21:32:14,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:32:14,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:14,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 192 [2025-01-09 21:32:14,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:14,755 INFO L124 PetriNetUnfolderBase]: 22/298 cut-off events. [2025-01-09 21:32:14,755 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:14,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 298 events. 22/298 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1007 event pairs, 11 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 315. Up to 36 conditions per place. [2025-01-09 21:32:14,757 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 12 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-01-09 21:32:14,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 167 transitions, 370 flow [2025-01-09 21:32:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-01-09 21:32:14,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114583333333334 [2025-01-09 21:32:14,759 INFO L175 Difference]: Start difference. First operand has 170 places, 168 transitions, 344 flow. Second operand 3 states and 525 transitions. [2025-01-09 21:32:14,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 167 transitions, 370 flow [2025-01-09 21:32:14,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 167 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:14,762 INFO L231 Difference]: Finished difference. Result has 168 places, 167 transitions, 342 flow [2025-01-09 21:32:14,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=168, PETRI_TRANSITIONS=167} [2025-01-09 21:32:14,762 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -4 predicate places. [2025-01-09 21:32:14,763 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 167 transitions, 342 flow [2025-01-09 21:32:14,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:32:14,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:14,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:14,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:14,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:14,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2097379152, now seen corresponding path program 1 times [2025-01-09 21:32:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:14,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620695894] [2025-01-09 21:32:14,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:14,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:14,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:32:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:32:14,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:14,786 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:32:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620695894] [2025-01-09 21:32:14,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620695894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415760930] [2025-01-09 21:32:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:14,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:14,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:14,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:14,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 192 [2025-01-09 21:32:14,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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:32:14,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:14,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 192 [2025-01-09 21:32:14,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:14,831 INFO L124 PetriNetUnfolderBase]: 16/254 cut-off events. [2025-01-09 21:32:14,831 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:32:14,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 254 events. 16/254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 660 event pairs, 7 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 257. Up to 27 conditions per place. [2025-01-09 21:32:14,832 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-01-09 21:32:14,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 166 transitions, 364 flow [2025-01-09 21:32:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-01-09 21:32:14,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9184027777777778 [2025-01-09 21:32:14,834 INFO L175 Difference]: Start difference. First operand has 168 places, 167 transitions, 342 flow. Second operand 3 states and 529 transitions. [2025-01-09 21:32:14,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 166 transitions, 364 flow [2025-01-09 21:32:14,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:14,836 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 340 flow [2025-01-09 21:32:14,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2025-01-09 21:32:14,837 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -5 predicate places. [2025-01-09 21:32:14,837 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 340 flow [2025-01-09 21:32:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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:32:14,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:14,837 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:32:14,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:14,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:14,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -730082184, now seen corresponding path program 1 times [2025-01-09 21:32:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687925175] [2025-01-09 21:32:14,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:14,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:32:14,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:32:14,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:14,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:14,881 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:32:14,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:14,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687925175] [2025-01-09 21:32:14,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687925175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:14,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038729365] [2025-01-09 21:32:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:14,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:14,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:14,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2025-01-09 21:32:14,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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:32:14,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:14,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2025-01-09 21:32:14,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:14,940 INFO L124 PetriNetUnfolderBase]: 20/375 cut-off events. [2025-01-09 21:32:14,940 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:32:14,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 375 events. 20/375 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1417 event pairs, 5 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 370. Up to 22 conditions per place. [2025-01-09 21:32:14,941 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 11 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-01-09 21:32:14,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 165 transitions, 364 flow [2025-01-09 21:32:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:32:14,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9149305555555556 [2025-01-09 21:32:14,943 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 340 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:32:14,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 165 transitions, 364 flow [2025-01-09 21:32:14,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 165 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:14,945 INFO L231 Difference]: Finished difference. Result has 166 places, 165 transitions, 338 flow [2025-01-09 21:32:14,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=166, PETRI_TRANSITIONS=165} [2025-01-09 21:32:14,946 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -6 predicate places. [2025-01-09 21:32:14,946 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 165 transitions, 338 flow [2025-01-09 21:32:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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:32:14,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:14,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:14,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:14,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash -436061472, now seen corresponding path program 1 times [2025-01-09 21:32:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923396581] [2025-01-09 21:32:14,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:14,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:32:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:32:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:14,979 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:32:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923396581] [2025-01-09 21:32:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923396581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508113018] [2025-01-09 21:32:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:14,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:14,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:14,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2025-01-09 21:32:15,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 165 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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:32:15,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2025-01-09 21:32:15,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,040 INFO L124 PetriNetUnfolderBase]: 20/260 cut-off events. [2025-01-09 21:32:15,041 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:15,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 260 events. 20/260 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 788 event pairs, 11 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 253. Up to 34 conditions per place. [2025-01-09 21:32:15,042 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-01-09 21:32:15,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 164 transitions, 362 flow [2025-01-09 21:32:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:32:15,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9149305555555556 [2025-01-09 21:32:15,043 INFO L175 Difference]: Start difference. First operand has 166 places, 165 transitions, 338 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:32:15,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 164 transitions, 362 flow [2025-01-09 21:32:15,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 164 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,045 INFO L231 Difference]: Finished difference. Result has 165 places, 164 transitions, 336 flow [2025-01-09 21:32:15,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=165, PETRI_TRANSITIONS=164} [2025-01-09 21:32:15,046 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -7 predicate places. [2025-01-09 21:32:15,046 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 164 transitions, 336 flow [2025-01-09 21:32:15,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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:32:15,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:15,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1398972453, now seen corresponding path program 1 times [2025-01-09 21:32:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239839457] [2025-01-09 21:32:15,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:32:15,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:32:15,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,076 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:32:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239839457] [2025-01-09 21:32:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239839457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980733707] [2025-01-09 21:32:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 192 [2025-01-09 21:32:15,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:32:15,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 192 [2025-01-09 21:32:15,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,116 INFO L124 PetriNetUnfolderBase]: 14/207 cut-off events. [2025-01-09 21:32:15,116 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:32:15,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 207 events. 14/207 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 454 event pairs, 6 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 196. Up to 25 conditions per place. [2025-01-09 21:32:15,117 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 12 selfloop transitions, 3 changer transitions 0/163 dead transitions. [2025-01-09 21:32:15,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 163 transitions, 366 flow [2025-01-09 21:32:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2025-01-09 21:32:15,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:32:15,119 INFO L175 Difference]: Start difference. First operand has 165 places, 164 transitions, 336 flow. Second operand 3 states and 528 transitions. [2025-01-09 21:32:15,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 163 transitions, 366 flow [2025-01-09 21:32:15,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,121 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 339 flow [2025-01-09 21:32:15,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2025-01-09 21:32:15,122 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -9 predicate places. [2025-01-09 21:32:15,122 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 339 flow [2025-01-09 21:32:15,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:32:15,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:15,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1544813811, now seen corresponding path program 1 times [2025-01-09 21:32:15,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570193450] [2025-01-09 21:32:15,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:32:15,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:32:15,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,157 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:32:15,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570193450] [2025-01-09 21:32:15,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570193450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813358584] [2025-01-09 21:32:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 192 [2025-01-09 21:32:15,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:32:15,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 192 [2025-01-09 21:32:15,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,209 INFO L124 PetriNetUnfolderBase]: 51/414 cut-off events. [2025-01-09 21:32:15,209 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:32:15,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 414 events. 51/414 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1790 event pairs, 11 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 387. Up to 56 conditions per place. [2025-01-09 21:32:15,211 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 16 selfloop transitions, 3 changer transitions 0/165 dead transitions. [2025-01-09 21:32:15,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 165 transitions, 387 flow [2025-01-09 21:32:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2025-01-09 21:32:15,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236111111111112 [2025-01-09 21:32:15,212 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 339 flow. Second operand 3 states and 532 transitions. [2025-01-09 21:32:15,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 165 transitions, 387 flow [2025-01-09 21:32:15,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 165 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:15,214 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 343 flow [2025-01-09 21:32:15,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-01-09 21:32:15,215 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -10 predicate places. [2025-01-09 21:32:15,215 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 343 flow [2025-01-09 21:32:15,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:32:15,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:15,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,216 INFO L85 PathProgramCache]: Analyzing trace with hash -659389399, now seen corresponding path program 1 times [2025-01-09 21:32:15,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919122439] [2025-01-09 21:32:15,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:32:15,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:32:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,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:32:15,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919122439] [2025-01-09 21:32:15,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919122439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936311198] [2025-01-09 21:32:15,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 192 [2025-01-09 21:32:15,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 160 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:32:15,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 192 [2025-01-09 21:32:15,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,318 INFO L124 PetriNetUnfolderBase]: 43/531 cut-off events. [2025-01-09 21:32:15,319 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:15,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 531 events. 43/531 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2611 event pairs, 14 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 393. Up to 59 conditions per place. [2025-01-09 21:32:15,322 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 11 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-01-09 21:32:15,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 161 transitions, 373 flow [2025-01-09 21:32:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2025-01-09 21:32:15,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9322916666666666 [2025-01-09 21:32:15,326 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 343 flow. Second operand 3 states and 537 transitions. [2025-01-09 21:32:15,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 161 transitions, 373 flow [2025-01-09 21:32:15,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 161 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:15,329 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 350 flow [2025-01-09 21:32:15,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-01-09 21:32:15,330 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -10 predicate places. [2025-01-09 21:32:15,331 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 350 flow [2025-01-09 21:32:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:32:15,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:15,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1311288106, now seen corresponding path program 1 times [2025-01-09 21:32:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843530134] [2025-01-09 21:32:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:32:15,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:32:15,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,397 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:32:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843530134] [2025-01-09 21:32:15,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843530134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311780600] [2025-01-09 21:32:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 192 [2025-01-09 21:32:15,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 160 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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:32:15,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 192 [2025-01-09 21:32:15,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,450 INFO L124 PetriNetUnfolderBase]: 30/338 cut-off events. [2025-01-09 21:32:15,450 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:32:15,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 338 events. 30/338 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1180 event pairs, 2 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 223. Up to 36 conditions per place. [2025-01-09 21:32:15,451 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 10 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-01-09 21:32:15,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 159 transitions, 374 flow [2025-01-09 21:32:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2025-01-09 21:32:15,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253472222222222 [2025-01-09 21:32:15,453 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 350 flow. Second operand 3 states and 533 transitions. [2025-01-09 21:32:15,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 159 transitions, 374 flow [2025-01-09 21:32:15,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:15,455 INFO L231 Difference]: Finished difference. Result has 162 places, 158 transitions, 350 flow [2025-01-09 21:32:15,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=162, PETRI_TRANSITIONS=158} [2025-01-09 21:32:15,455 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -10 predicate places. [2025-01-09 21:32:15,455 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 158 transitions, 350 flow [2025-01-09 21:32:15,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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:32:15,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:15,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1273156812, now seen corresponding path program 1 times [2025-01-09 21:32:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717203449] [2025-01-09 21:32:15,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:32:15,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:32:15,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,491 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:32:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717203449] [2025-01-09 21:32:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717203449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000608224] [2025-01-09 21:32:15,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 192 [2025-01-09 21:32:15,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 158 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:32:15,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 192 [2025-01-09 21:32:15,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,539 INFO L124 PetriNetUnfolderBase]: 37/365 cut-off events. [2025-01-09 21:32:15,540 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:32:15,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 365 events. 37/365 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1450 event pairs, 7 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 282. Up to 32 conditions per place. [2025-01-09 21:32:15,541 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 12 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-01-09 21:32:15,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 159 transitions, 381 flow [2025-01-09 21:32:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2025-01-09 21:32:15,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288194444444444 [2025-01-09 21:32:15,542 INFO L175 Difference]: Start difference. First operand has 162 places, 158 transitions, 350 flow. Second operand 3 states and 535 transitions. [2025-01-09 21:32:15,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 159 transitions, 381 flow [2025-01-09 21:32:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,544 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 346 flow [2025-01-09 21:32:15,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2025-01-09 21:32:15,545 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -12 predicate places. [2025-01-09 21:32:15,545 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 346 flow [2025-01-09 21:32:15,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:32:15,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:15,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash 939536307, now seen corresponding path program 1 times [2025-01-09 21:32:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342967250] [2025-01-09 21:32:15,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:32:15,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:32:15,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,579 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:32:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342967250] [2025-01-09 21:32:15,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342967250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324956302] [2025-01-09 21:32:15,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 192 [2025-01-09 21:32:15,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:32:15,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 192 [2025-01-09 21:32:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,646 INFO L124 PetriNetUnfolderBase]: 47/519 cut-off events. [2025-01-09 21:32:15,646 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:15,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 519 events. 47/519 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2529 event pairs, 12 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 485. Up to 48 conditions per place. [2025-01-09 21:32:15,648 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 11 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-01-09 21:32:15,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 374 flow [2025-01-09 21:32:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2025-01-09 21:32:15,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253472222222222 [2025-01-09 21:32:15,649 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 346 flow. Second operand 3 states and 533 transitions. [2025-01-09 21:32:15,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 374 flow [2025-01-09 21:32:15,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 156 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,651 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 344 flow [2025-01-09 21:32:15,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2025-01-09 21:32:15,652 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -13 predicate places. [2025-01-09 21:32:15,652 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 344 flow [2025-01-09 21:32:15,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:32:15,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:15,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1753088667, now seen corresponding path program 1 times [2025-01-09 21:32:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918769101] [2025-01-09 21:32:15,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:32:15,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:32:15,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,692 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:32:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918769101] [2025-01-09 21:32:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918769101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608570183] [2025-01-09 21:32:15,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 192 [2025-01-09 21:32:15,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:32:15,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 192 [2025-01-09 21:32:15,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,749 INFO L124 PetriNetUnfolderBase]: 40/376 cut-off events. [2025-01-09 21:32:15,749 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:32:15,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 376 events. 40/376 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1439 event pairs, 16 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 456. Up to 53 conditions per place. [2025-01-09 21:32:15,750 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:32:15,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 157 transitions, 379 flow [2025-01-09 21:32:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2025-01-09 21:32:15,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288194444444444 [2025-01-09 21:32:15,752 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 344 flow. Second operand 3 states and 535 transitions. [2025-01-09 21:32:15,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 157 transitions, 379 flow [2025-01-09 21:32:15,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 157 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,754 INFO L231 Difference]: Finished difference. Result has 158 places, 154 transitions, 342 flow [2025-01-09 21:32:15,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=158, PETRI_TRANSITIONS=154} [2025-01-09 21:32:15,755 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -14 predicate places. [2025-01-09 21:32:15,755 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 154 transitions, 342 flow [2025-01-09 21:32:15,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:32:15,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:15,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1827438360, now seen corresponding path program 1 times [2025-01-09 21:32:15,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561749653] [2025-01-09 21:32:15,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:32:15,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:32:15,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561749653] [2025-01-09 21:32:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561749653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635888075] [2025-01-09 21:32:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 192 [2025-01-09 21:32:15,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 154 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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:32:15,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 192 [2025-01-09 21:32:15,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,848 INFO L124 PetriNetUnfolderBase]: 33/335 cut-off events. [2025-01-09 21:32:15,849 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:32:15,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 335 events. 33/335 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1243 event pairs, 14 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 440. Up to 51 conditions per place. [2025-01-09 21:32:15,850 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 13 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-01-09 21:32:15,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 154 transitions, 374 flow [2025-01-09 21:32:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2025-01-09 21:32:15,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.921875 [2025-01-09 21:32:15,852 INFO L175 Difference]: Start difference. First operand has 158 places, 154 transitions, 342 flow. Second operand 3 states and 531 transitions. [2025-01-09 21:32:15,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 154 transitions, 374 flow [2025-01-09 21:32:15,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 154 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,854 INFO L231 Difference]: Finished difference. Result has 157 places, 153 transitions, 340 flow [2025-01-09 21:32:15,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=157, PETRI_TRANSITIONS=153} [2025-01-09 21:32:15,854 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -15 predicate places. [2025-01-09 21:32:15,855 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 153 transitions, 340 flow [2025-01-09 21:32:15,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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:32:15,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:15,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:32:15,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2023927168, now seen corresponding path program 1 times [2025-01-09 21:32:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051167637] [2025-01-09 21:32:15,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:32:15,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:32:15,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,893 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:32:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051167637] [2025-01-09 21:32:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051167637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608532469] [2025-01-09 21:32:15,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 192 [2025-01-09 21:32:15,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 153 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:32:15,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 192 [2025-01-09 21:32:15,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,955 INFO L124 PetriNetUnfolderBase]: 45/380 cut-off events. [2025-01-09 21:32:15,955 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:32:15,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 380 events. 45/380 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1517 event pairs, 14 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 489. Up to 62 conditions per place. [2025-01-09 21:32:15,956 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 0 selfloop transitions, 0 changer transitions 155/155 dead transitions. [2025-01-09 21:32:15,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 155 transitions, 379 flow [2025-01-09 21:32:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2025-01-09 21:32:15,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253472222222222 [2025-01-09 21:32:15,958 INFO L175 Difference]: Start difference. First operand has 157 places, 153 transitions, 340 flow. Second operand 3 states and 533 transitions. [2025-01-09 21:32:15,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 155 transitions, 379 flow [2025-01-09 21:32:15,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 155 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,960 INFO L231 Difference]: Finished difference. Result has 156 places, 0 transitions, 0 flow [2025-01-09 21:32:15,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=156, PETRI_TRANSITIONS=0} [2025-01-09 21:32:15,960 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -16 predicate places. [2025-01-09 21:32:15,960 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 0 transitions, 0 flow [2025-01-09 21:32:15,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-01-09 21:32:15,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-01-09 21:32:15,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-01-09 21:32:15,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-01-09 21:32:15,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:15,966 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,969 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:15,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:15,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:15 BasicIcfg [2025-01-09 21:32:15,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:15,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:15,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:15,973 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:15,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:14" (3/4) ... [2025-01-09 21:32:15,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:15,976 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:15,976 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:15,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 21:32:15,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:15,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:15,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:16,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:16,030 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:16,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:16,030 INFO L158 Benchmark]: Toolchain (without parser) took 2477.40ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 109.0MB in the beginning and 229.7MB in the end (delta: -120.8MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:16,030 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:16,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.09ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 97.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:16,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.44ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:16,031 INFO L158 Benchmark]: Boogie Preprocessor took 15.91ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:16,031 INFO L158 Benchmark]: RCFGBuilder took 401.67ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 76.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:16,031 INFO L158 Benchmark]: TraceAbstraction took 1799.89ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 76.8MB in the beginning and 234.9MB in the end (delta: -158.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:16,032 INFO L158 Benchmark]: Witness Printer took 56.61ms. Allocated memory is still 360.7MB. Free memory was 234.9MB in the beginning and 229.7MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:16,032 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.14ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.09ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 97.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.44ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.91ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 401.67ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 76.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1799.89ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 76.8MB in the beginning and 234.9MB in the end (delta: -158.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 56.61ms. Allocated memory is still 360.7MB. Free memory was 234.9MB in the beginning and 229.7MB 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: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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, 262 locations, 37 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: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 441 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 75 mSDtfsCounter, 441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 931 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:16,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE