./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-symm.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/chl-exp-term-symm.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 a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:27,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:27,712 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:30:27,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:27,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:27,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:27,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:27,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:27,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:27,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:27,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:27,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:27,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:27,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:27,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:27,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:27,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:27,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:27,734 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 -> a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb [2025-01-09 21:30:27,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:27,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:28,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:28,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:28,005 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:28,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2025-01-09 21:30:29,151 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c8ae851/f7a488529f2b4a2ab700a67ca8683c55/FLAG49e4b583b [2025-01-09 21:30:29,409 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:29,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2025-01-09 21:30:29,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c8ae851/f7a488529f2b4a2ab700a67ca8683c55/FLAG49e4b583b [2025-01-09 21:30:29,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c8ae851/f7a488529f2b4a2ab700a67ca8683c55 [2025-01-09 21:30:29,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:29,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:29,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:29,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:29,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:29,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1d7632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29, skipping insertion in model container [2025-01-09 21:30:29,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:29,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:29,571 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:29,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:29,607 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:29,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29 WrapperNode [2025-01-09 21:30:29,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:29,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:29,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:29,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:29,615 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:30:29" (1/1) ... [2025-01-09 21:30:29,620 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:30:29" (1/1) ... [2025-01-09 21:30:29,635 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 237 [2025-01-09 21:30:29,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:29,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:29,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:29,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:29,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:29,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:29,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:29,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:29,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (1/1) ... [2025-01-09 21:30:29,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:29,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:29,678 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:30:29,680 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:30:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:29,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:29,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:29,700 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:30:29,771 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:29,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:30,047 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:30,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:30,059 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:30,059 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:30,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:30 BoogieIcfgContainer [2025-01-09 21:30:30,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:30,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:30,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:30,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:30,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:29" (1/3) ... [2025-01-09 21:30:30,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e817e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:30, skipping insertion in model container [2025-01-09 21:30:30,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:29" (2/3) ... [2025-01-09 21:30:30,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e817e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:30, skipping insertion in model container [2025-01-09 21:30:30,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:30" (3/3) ... [2025-01-09 21:30:30,067 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-symm.wvr.c [2025-01-09 21:30:30,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:30,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-symm.wvr.c that has 3 procedures, 304 locations, 1 initial locations, 0 loop locations, and 32 error locations. [2025-01-09 21:30:30,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:30,144 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:30:30,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 325 transitions, 664 flow [2025-01-09 21:30:30,326 INFO L124 PetriNetUnfolderBase]: 22/323 cut-off events. [2025-01-09 21:30:30,328 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:30,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 323 events. 22/323 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 770 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2025-01-09 21:30:30,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 325 transitions, 664 flow [2025-01-09 21:30:30,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 303 transitions, 618 flow [2025-01-09 21:30:30,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:30,352 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;@78b9a705, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:30,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-01-09 21:30:30,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:30,357 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:30:30,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:30,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,358 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] [2025-01-09 21:30:30,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:30,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash 673294805, now seen corresponding path program 1 times [2025-01-09 21:30:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189549651] [2025-01-09 21:30:30,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:30:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:30:30,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,466 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:30:30,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189549651] [2025-01-09 21:30:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189549651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632170143] [2025-01-09 21:30:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 325 [2025-01-09 21:30:30,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 303 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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:30:30,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 325 [2025-01-09 21:30:30,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,646 INFO L124 PetriNetUnfolderBase]: 39/568 cut-off events. [2025-01-09 21:30:30,646 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-01-09 21:30:30,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 568 events. 39/568 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2575 event pairs, 8 based on Foata normal form. 16/481 useless extension candidates. Maximal degree in co-relation 419. Up to 30 conditions per place. [2025-01-09 21:30:30,653 INFO L140 encePairwiseOnDemand]: 316/325 looper letters, 11 selfloop transitions, 2 changer transitions 2/296 dead transitions. [2025-01-09 21:30:30,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 296 transitions, 630 flow [2025-01-09 21:30:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-01-09 21:30:30,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2025-01-09 21:30:30,667 INFO L175 Difference]: Start difference. First operand has 290 places, 303 transitions, 618 flow. Second operand 3 states and 926 transitions. [2025-01-09 21:30:30,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 296 transitions, 630 flow [2025-01-09 21:30:30,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 296 transitions, 622 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:30:30,676 INFO L231 Difference]: Finished difference. Result has 287 places, 294 transitions, 596 flow [2025-01-09 21:30:30,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2025-01-09 21:30:30,681 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -3 predicate places. [2025-01-09 21:30:30,682 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 596 flow [2025-01-09 21:30:30,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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:30:30,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:30,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:30,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:30,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1390746223, now seen corresponding path program 1 times [2025-01-09 21:30:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654695284] [2025-01-09 21:30:30,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:30:30,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:30:30,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,723 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:30:30,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654695284] [2025-01-09 21:30:30,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654695284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820111603] [2025-01-09 21:30:30,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 325 [2025-01-09 21:30:30,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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:30:30,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 325 [2025-01-09 21:30:30,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,810 INFO L124 PetriNetUnfolderBase]: 39/568 cut-off events. [2025-01-09 21:30:30,810 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:30:30,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 568 events. 39/568 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2569 event pairs, 8 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 578. Up to 30 conditions per place. [2025-01-09 21:30:30,814 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-01-09 21:30:30,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 293 transitions, 620 flow [2025-01-09 21:30:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2025-01-09 21:30:30,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435897435897436 [2025-01-09 21:30:30,817 INFO L175 Difference]: Start difference. First operand has 287 places, 294 transitions, 596 flow. Second operand 3 states and 920 transitions. [2025-01-09 21:30:30,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 293 transitions, 620 flow [2025-01-09 21:30:30,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 293 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:30,821 INFO L231 Difference]: Finished difference. Result has 284 places, 293 transitions, 594 flow [2025-01-09 21:30:30,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=284, PETRI_TRANSITIONS=293} [2025-01-09 21:30:30,822 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -6 predicate places. [2025-01-09 21:30:30,822 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 293 transitions, 594 flow [2025-01-09 21:30:30,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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:30:30,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,823 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:30:30,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:30,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:30,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash -233594283, now seen corresponding path program 1 times [2025-01-09 21:30:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-01-09 21:30:30,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:30:30,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:30:30,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,857 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:30:30,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-01-09 21:30:30,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361304329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334976414] [2025-01-09 21:30:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-01-09 21:30:30,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 293 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:30,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-01-09 21:30:30,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,966 INFO L124 PetriNetUnfolderBase]: 53/682 cut-off events. [2025-01-09 21:30:30,966 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:30,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 682 events. 53/682 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3653 event pairs, 15 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 699. Up to 44 conditions per place. [2025-01-09 21:30:30,970 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-01-09 21:30:30,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 292 transitions, 622 flow [2025-01-09 21:30:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-01-09 21:30:30,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2025-01-09 21:30:30,973 INFO L175 Difference]: Start difference. First operand has 284 places, 293 transitions, 594 flow. Second operand 3 states and 916 transitions. [2025-01-09 21:30:30,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 292 transitions, 622 flow [2025-01-09 21:30:30,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 292 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:30,976 INFO L231 Difference]: Finished difference. Result has 283 places, 292 transitions, 592 flow [2025-01-09 21:30:30,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=283, PETRI_TRANSITIONS=292} [2025-01-09 21:30:30,977 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -7 predicate places. [2025-01-09 21:30:30,977 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 292 transitions, 592 flow [2025-01-09 21:30:30,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:30,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,978 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:30:30,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:30,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:30,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2064059098, now seen corresponding path program 1 times [2025-01-09 21:30:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667479736] [2025-01-09 21:30:30,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:30:30,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:30:30,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,017 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:30:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667479736] [2025-01-09 21:30:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667479736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349692059] [2025-01-09 21:30:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-01-09 21:30:31,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 292 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:31,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-01-09 21:30:31,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,109 INFO L124 PetriNetUnfolderBase]: 53/669 cut-off events. [2025-01-09 21:30:31,109 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:31,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 669 events. 53/669 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3632 event pairs, 15 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 678. Up to 44 conditions per place. [2025-01-09 21:30:31,113 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-01-09 21:30:31,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 291 transitions, 620 flow [2025-01-09 21:30:31,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-01-09 21:30:31,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2025-01-09 21:30:31,116 INFO L175 Difference]: Start difference. First operand has 283 places, 292 transitions, 592 flow. Second operand 3 states and 916 transitions. [2025-01-09 21:30:31,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 291 transitions, 620 flow [2025-01-09 21:30:31,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,119 INFO L231 Difference]: Finished difference. Result has 282 places, 291 transitions, 590 flow [2025-01-09 21:30:31,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=282, PETRI_TRANSITIONS=291} [2025-01-09 21:30:31,120 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -8 predicate places. [2025-01-09 21:30:31,120 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 291 transitions, 590 flow [2025-01-09 21:30:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:31,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,121 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] [2025-01-09 21:30:31,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:31,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:31,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1269218742, now seen corresponding path program 1 times [2025-01-09 21:30:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879521743] [2025-01-09 21:30:31,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:30:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:30:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,162 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:30:31,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879521743] [2025-01-09 21:30:31,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879521743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593374264] [2025-01-09 21:30:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 325 [2025-01-09 21:30:31,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:31,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 325 [2025-01-09 21:30:31,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,301 INFO L124 PetriNetUnfolderBase]: 116/1116 cut-off events. [2025-01-09 21:30:31,301 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:30:31,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1116 events. 116/1116 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7568 event pairs, 36 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1188. Up to 110 conditions per place. [2025-01-09 21:30:31,307 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 18 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-01-09 21:30:31,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 288 transitions, 625 flow [2025-01-09 21:30:31,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-01-09 21:30:31,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9312820512820513 [2025-01-09 21:30:31,309 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 590 flow. Second operand 3 states and 908 transitions. [2025-01-09 21:30:31,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 288 transitions, 625 flow [2025-01-09 21:30:31,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 288 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,313 INFO L231 Difference]: Finished difference. Result has 277 places, 287 transitions, 588 flow [2025-01-09 21:30:31,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=277, PETRI_TRANSITIONS=287} [2025-01-09 21:30:31,314 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2025-01-09 21:30:31,314 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 287 transitions, 588 flow [2025-01-09 21:30:31,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:31,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,314 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] [2025-01-09 21:30:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:31,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash -51476264, now seen corresponding path program 1 times [2025-01-09 21:30:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029036827] [2025-01-09 21:30:31,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:30:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:30:31,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,354 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:30:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029036827] [2025-01-09 21:30:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029036827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849468764] [2025-01-09 21:30:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 325 [2025-01-09 21:30:31,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 287 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:31,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 325 [2025-01-09 21:30:31,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,474 INFO L124 PetriNetUnfolderBase]: 145/1395 cut-off events. [2025-01-09 21:30:31,475 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:30:31,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 1395 events. 145/1395 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10386 event pairs, 36 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1393. Up to 128 conditions per place. [2025-01-09 21:30:31,482 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 18 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-01-09 21:30:31,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 284 transitions, 623 flow [2025-01-09 21:30:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-01-09 21:30:31,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9312820512820513 [2025-01-09 21:30:31,484 INFO L175 Difference]: Start difference. First operand has 277 places, 287 transitions, 588 flow. Second operand 3 states and 908 transitions. [2025-01-09 21:30:31,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 284 transitions, 623 flow [2025-01-09 21:30:31,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 284 transitions, 623 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:31,488 INFO L231 Difference]: Finished difference. Result has 274 places, 283 transitions, 590 flow [2025-01-09 21:30:31,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=274, PETRI_TRANSITIONS=283} [2025-01-09 21:30:31,488 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -16 predicate places. [2025-01-09 21:30:31,488 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 283 transitions, 590 flow [2025-01-09 21:30:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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:30:31,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,489 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] [2025-01-09 21:30:31,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:31,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:31,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1451095893, now seen corresponding path program 1 times [2025-01-09 21:30:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568349518] [2025-01-09 21:30:31,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:30:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:30:31,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,570 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:30:31,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568349518] [2025-01-09 21:30:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568349518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:31,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11023614] [2025-01-09 21:30:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2025-01-09 21:30:31,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 283 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:30:31,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2025-01-09 21:30:31,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,716 INFO L124 PetriNetUnfolderBase]: 41/561 cut-off events. [2025-01-09 21:30:31,716 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:30:31,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 561 events. 41/561 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2846 event pairs, 5 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 465. Up to 22 conditions per place. [2025-01-09 21:30:31,724 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 11 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2025-01-09 21:30:31,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 286 transitions, 625 flow [2025-01-09 21:30:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2025-01-09 21:30:31,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569230769230769 [2025-01-09 21:30:31,726 INFO L175 Difference]: Start difference. First operand has 274 places, 283 transitions, 590 flow. Second operand 3 states and 933 transitions. [2025-01-09 21:30:31,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 286 transitions, 625 flow [2025-01-09 21:30:31,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 286 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:31,731 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 612 flow [2025-01-09 21:30:31,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2025-01-09 21:30:31,734 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2025-01-09 21:30:31,734 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 612 flow [2025-01-09 21:30:31,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:30:31,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,735 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] [2025-01-09 21:30:31,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:31,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:31,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 507844781, now seen corresponding path program 1 times [2025-01-09 21:30:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473497354] [2025-01-09 21:30:31,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:30:31,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:30:31,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,774 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:30:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473497354] [2025-01-09 21:30:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473497354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951603592] [2025-01-09 21:30:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-01-09 21:30:31,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:31,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-01-09 21:30:31,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,882 INFO L124 PetriNetUnfolderBase]: 103/1220 cut-off events. [2025-01-09 21:30:31,882 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-01-09 21:30:31,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1220 events. 103/1220 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8360 event pairs, 8 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1178. Up to 87 conditions per place. [2025-01-09 21:30:31,889 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 16 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2025-01-09 21:30:31,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 288 transitions, 661 flow [2025-01-09 21:30:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-01-09 21:30:31,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-01-09 21:30:31,891 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 612 flow. Second operand 3 states and 924 transitions. [2025-01-09 21:30:31,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 288 transitions, 661 flow [2025-01-09 21:30:31,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 288 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,895 INFO L231 Difference]: Finished difference. Result has 275 places, 285 transitions, 626 flow [2025-01-09 21:30:31,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=275, PETRI_TRANSITIONS=285} [2025-01-09 21:30:31,896 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -15 predicate places. [2025-01-09 21:30:31,896 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 285 transitions, 626 flow [2025-01-09 21:30:31,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:31,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,896 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] [2025-01-09 21:30:31,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:31,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:31,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1587410957, now seen corresponding path program 1 times [2025-01-09 21:30:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182629877] [2025-01-09 21:30:31,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:30:31,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:30:31,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,953 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:30:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182629877] [2025-01-09 21:30:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182629877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904059021] [2025-01-09 21:30:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-01-09 21:30:31,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:31,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-01-09 21:30:31,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,089 INFO L124 PetriNetUnfolderBase]: 123/1346 cut-off events. [2025-01-09 21:30:32,090 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-01-09 21:30:32,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1346 events. 123/1346 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9792 event pairs, 14 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 1352. Up to 99 conditions per place. [2025-01-09 21:30:32,098 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 16 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2025-01-09 21:30:32,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 288 transitions, 675 flow [2025-01-09 21:30:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-01-09 21:30:32,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-01-09 21:30:32,100 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 626 flow. Second operand 3 states and 924 transitions. [2025-01-09 21:30:32,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 288 transitions, 675 flow [2025-01-09 21:30:32,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 288 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:32,105 INFO L231 Difference]: Finished difference. Result has 274 places, 285 transitions, 646 flow [2025-01-09 21:30:32,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=274, PETRI_TRANSITIONS=285} [2025-01-09 21:30:32,106 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -16 predicate places. [2025-01-09 21:30:32,106 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 285 transitions, 646 flow [2025-01-09 21:30:32,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:30:32,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,107 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] [2025-01-09 21:30:32,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:32,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:32,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash 588439863, now seen corresponding path program 1 times [2025-01-09 21:30:32,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-01-09 21:30:32,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:30:32,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:30:32,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,149 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:30:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-01-09 21:30:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100286460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923440684] [2025-01-09 21:30:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 325 [2025-01-09 21:30:32,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 285 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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:30:32,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 325 [2025-01-09 21:30:32,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,253 INFO L124 PetriNetUnfolderBase]: 110/1245 cut-off events. [2025-01-09 21:30:32,253 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-01-09 21:30:32,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1245 events. 110/1245 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8545 event pairs, 6 based on Foata normal form. 2/1118 useless extension candidates. Maximal degree in co-relation 1261. Up to 38 conditions per place. [2025-01-09 21:30:32,260 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-01-09 21:30:32,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 285 transitions, 671 flow [2025-01-09 21:30:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-01-09 21:30:32,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-01-09 21:30:32,262 INFO L175 Difference]: Start difference. First operand has 274 places, 285 transitions, 646 flow. Second operand 3 states and 928 transitions. [2025-01-09 21:30:32,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 285 transitions, 671 flow [2025-01-09 21:30:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 285 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:32,265 INFO L231 Difference]: Finished difference. Result has 275 places, 284 transitions, 648 flow [2025-01-09 21:30:32,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=275, PETRI_TRANSITIONS=284} [2025-01-09 21:30:32,266 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -15 predicate places. [2025-01-09 21:30:32,266 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 284 transitions, 648 flow [2025-01-09 21:30:32,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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:30:32,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,267 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] [2025-01-09 21:30:32,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:32,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1865929805, now seen corresponding path program 1 times [2025-01-09 21:30:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564336615] [2025-01-09 21:30:32,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:30:32,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:30:32,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,315 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:30:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564336615] [2025-01-09 21:30:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564336615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104895249] [2025-01-09 21:30:32,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2025-01-09 21:30:32,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 284 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 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:30:32,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2025-01-09 21:30:32,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,406 INFO L124 PetriNetUnfolderBase]: 104/1158 cut-off events. [2025-01-09 21:30:32,406 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-01-09 21:30:32,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1158 events. 104/1158 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7743 event pairs, 10 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 1165. Up to 81 conditions per place. [2025-01-09 21:30:32,414 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 11 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2025-01-09 21:30:32,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 287 transitions, 683 flow [2025-01-09 21:30:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2025-01-09 21:30:32,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569230769230769 [2025-01-09 21:30:32,416 INFO L175 Difference]: Start difference. First operand has 275 places, 284 transitions, 648 flow. Second operand 3 states and 933 transitions. [2025-01-09 21:30:32,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 287 transitions, 683 flow [2025-01-09 21:30:32,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 287 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:32,421 INFO L231 Difference]: Finished difference. Result has 277 places, 286 transitions, 666 flow [2025-01-09 21:30:32,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=277, PETRI_TRANSITIONS=286} [2025-01-09 21:30:32,422 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2025-01-09 21:30:32,422 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 286 transitions, 666 flow [2025-01-09 21:30:32,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 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:30:32,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,423 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] [2025-01-09 21:30:32,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:32,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:32,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1006838745, now seen corresponding path program 1 times [2025-01-09 21:30:32,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073712139] [2025-01-09 21:30:32,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:30:32,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:30:32,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,470 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:30:32,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073712139] [2025-01-09 21:30:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073712139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133207783] [2025-01-09 21:30:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 325 [2025-01-09 21:30:32,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 286 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 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:30:32,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 325 [2025-01-09 21:30:32,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,597 INFO L124 PetriNetUnfolderBase]: 104/1038 cut-off events. [2025-01-09 21:30:32,597 INFO L125 PetriNetUnfolderBase]: For 57/59 co-relation queries the response was YES. [2025-01-09 21:30:32,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 1038 events. 104/1038 cut-off events. For 57/59 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6720 event pairs, 6 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1111. Up to 65 conditions per place. [2025-01-09 21:30:32,605 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2025-01-09 21:30:32,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 286 transitions, 691 flow [2025-01-09 21:30:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-01-09 21:30:32,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-01-09 21:30:32,607 INFO L175 Difference]: Start difference. First operand has 277 places, 286 transitions, 666 flow. Second operand 3 states and 928 transitions. [2025-01-09 21:30:32,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 286 transitions, 691 flow [2025-01-09 21:30:32,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 286 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:32,633 INFO L231 Difference]: Finished difference. Result has 276 places, 285 transitions, 662 flow [2025-01-09 21:30:32,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=276, PETRI_TRANSITIONS=285} [2025-01-09 21:30:32,634 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -14 predicate places. [2025-01-09 21:30:32,634 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 285 transitions, 662 flow [2025-01-09 21:30:32,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 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:30:32,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:32,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:32,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:32,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1478838205, now seen corresponding path program 1 times [2025-01-09 21:30:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-01-09 21:30:32,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:30:32,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:30:32,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,678 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:30:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-01-09 21:30:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484778562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275040476] [2025-01-09 21:30:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:30:32,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 285 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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:30:32,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:30:32,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,767 INFO L124 PetriNetUnfolderBase]: 99/1287 cut-off events. [2025-01-09 21:30:32,767 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-01-09 21:30:32,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1287 events. 99/1287 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8980 event pairs, 4 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1349. Up to 43 conditions per place. [2025-01-09 21:30:32,775 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2025-01-09 21:30:32,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 282 transitions, 678 flow [2025-01-09 21:30:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-01-09 21:30:32,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2025-01-09 21:30:32,777 INFO L175 Difference]: Start difference. First operand has 276 places, 285 transitions, 662 flow. Second operand 3 states and 923 transitions. [2025-01-09 21:30:32,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 282 transitions, 678 flow [2025-01-09 21:30:32,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 282 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:32,781 INFO L231 Difference]: Finished difference. Result has 273 places, 282 transitions, 654 flow [2025-01-09 21:30:32,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=273, PETRI_TRANSITIONS=282} [2025-01-09 21:30:32,782 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -17 predicate places. [2025-01-09 21:30:32,782 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 282 transitions, 654 flow [2025-01-09 21:30:32,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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:30:32,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,782 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, 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:30:32,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:32,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:30:32,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1804625381, now seen corresponding path program 1 times [2025-01-09 21:30:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303818340] [2025-01-09 21:30:32,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:32,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:32,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,818 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:30:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303818340] [2025-01-09 21:30:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303818340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546643341] [2025-01-09 21:30:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:30:32,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 282 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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:30:32,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:30:32,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,906 INFO L124 PetriNetUnfolderBase]: 86/1049 cut-off events. [2025-01-09 21:30:32,906 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-01-09 21:30:32,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 1049 events. 86/1049 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6311 event pairs, 4 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 1120. Up to 44 conditions per place. [2025-01-09 21:30:32,910 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2025-01-09 21:30:32,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 281 transitions, 676 flow [2025-01-09 21:30:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-01-09 21:30:32,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-01-09 21:30:32,912 INFO L175 Difference]: Start difference. First operand has 273 places, 282 transitions, 654 flow. Second operand 3 states and 924 transitions. [2025-01-09 21:30:32,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 281 transitions, 676 flow [2025-01-09 21:30:32,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 281 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:32,914 INFO L231 Difference]: Finished difference. Result has 271 places, 0 transitions, 0 flow [2025-01-09 21:30:32,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=271, PETRI_TRANSITIONS=0} [2025-01-09 21:30:32,914 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -19 predicate places. [2025-01-09 21:30:32,914 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 0 transitions, 0 flow [2025-01-09 21:30:32,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 56 remaining) [2025-01-09 21:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2025-01-09 21:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2025-01-09 21:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2025-01-09 21:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2025-01-09 21:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2025-01-09 21:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2025-01-09 21:30:32,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2025-01-09 21:30:32,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2025-01-09 21:30:32,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2025-01-09 21:30:32,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:32,919 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:32,922 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:32,922 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:32,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:32 BasicIcfg [2025-01-09 21:30:32,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:32,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:32,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:32,926 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:32,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:30" (3/4) ... [2025-01-09 21:30:32,927 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:32,929 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:32,929 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:32,931 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:30:32,931 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:32,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:32,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:32,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:32,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:32,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:32,981 INFO L158 Benchmark]: Toolchain (without parser) took 3555.45ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 135.1MB in the beginning and 153.9MB in the end (delta: -18.8MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,981 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:32,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.97ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 122.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,982 INFO L158 Benchmark]: Boogie Preprocessor took 16.83ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.8MB in the end (delta: 904.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:32,982 INFO L158 Benchmark]: RCFGBuilder took 406.11ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 96.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,982 INFO L158 Benchmark]: TraceAbstraction took 2864.06ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 95.6MB in the beginning and 162.3MB in the end (delta: -66.7MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,982 INFO L158 Benchmark]: Witness Printer took 54.86ms. Allocated memory is still 218.1MB. Free memory was 162.3MB in the beginning and 153.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,983 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.97ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 122.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.83ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.8MB in the end (delta: 904.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 406.11ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 96.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2864.06ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 95.6MB in the beginning and 162.3MB in the end (delta: -66.7MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. * Witness Printer took 54.86ms. Allocated memory is still 218.1MB. Free memory was 162.3MB in the beginning and 153.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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, 484 locations, 56 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: 2.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 431 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 410 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 133 mSDtfsCounter, 410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=666occurred in iteration=11, 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, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 890 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:32,995 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