./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:35:57,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:35:57,575 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:35:57,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:35:57,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:35:57,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:35:57,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:35:57,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:35:57,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:35:57,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:35:57,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:35:57,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:35:57,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:35:57,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:35:57,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:35:57,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:35:57,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:35:57,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:57,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:35:57,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:35:57,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:35:57,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:57,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:35:57,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:35:57,599 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2025-01-09 21:35:57,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:35:57,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:35:57,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:35:57,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:35:57,932 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:35:57,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-01-09 21:35:59,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e3819e9c/685058a4884d49bfab6bc745b71dab3c/FLAG790f09c7a [2025-01-09 21:35:59,431 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:35:59,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-01-09 21:35:59,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e3819e9c/685058a4884d49bfab6bc745b71dab3c/FLAG790f09c7a [2025-01-09 21:35:59,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e3819e9c/685058a4884d49bfab6bc745b71dab3c [2025-01-09 21:35:59,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:35:59,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:35:59,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:35:59,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:35:59,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:35:59,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef3fe73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59, skipping insertion in model container [2025-01-09 21:35:59,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:35:59,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:35:59,794 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:35:59,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:35:59,873 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:35:59,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59 WrapperNode [2025-01-09 21:35:59,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:35:59,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:35:59,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:35:59,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:35:59,879 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:35:59" (1/1) ... [2025-01-09 21:35:59,890 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:35:59" (1/1) ... [2025-01-09 21:35:59,903 INFO L138 Inliner]: procedures = 261, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-01-09 21:35:59,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:35:59,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:35:59,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:35:59,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:35:59,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:35:59,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:35:59,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:35:59,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:35:59,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (1/1) ... [2025-01-09 21:35:59,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:35:59,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:35:59,964 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:35:59,967 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:35:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:35:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:35:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:35:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:35:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:35:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:35:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:35:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:35:59,996 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:36:00,122 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:36:00,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:36:00,285 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:36:00,285 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:36:00,291 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:36:00,294 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:36:00,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:00 BoogieIcfgContainer [2025-01-09 21:36:00,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:36:00,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:36:00,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:36:00,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:36:00,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:35:59" (1/3) ... [2025-01-09 21:36:00,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759d0eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:00, skipping insertion in model container [2025-01-09 21:36:00,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:35:59" (2/3) ... [2025-01-09 21:36:00,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759d0eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:00, skipping insertion in model container [2025-01-09 21:36:00,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:00" (3/3) ... [2025-01-09 21:36:00,301 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2025-01-09 21:36:00,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:36:00,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-init.i that has 2 procedures, 86 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-09 21:36:00,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:36:00,379 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:36:00,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 88 transitions, 183 flow [2025-01-09 21:36:00,467 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-01-09 21:36:00,469 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:36:00,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 2/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 180 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-01-09 21:36:00,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 88 transitions, 183 flow [2025-01-09 21:36:00,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 88 transitions, 183 flow [2025-01-09 21:36:00,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:36:00,494 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;@13e37ff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:36:00,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 21:36:00,507 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:36:00,507 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-01-09 21:36:00,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:36:00,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:00,508 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] [2025-01-09 21:36:00,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:00,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1909169921, now seen corresponding path program 1 times [2025-01-09 21:36:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061629178] [2025-01-09 21:36:00,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:00,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:36:00,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:36:00,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:00,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:01,026 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:36:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061629178] [2025-01-09 21:36:01,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061629178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:01,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:01,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:01,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773120280] [2025-01-09 21:36:01,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:01,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:01,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:01,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:01,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:01,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-01-09 21:36:01,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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:36:01,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:01,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-01-09 21:36:01,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:01,330 INFO L124 PetriNetUnfolderBase]: 91/418 cut-off events. [2025-01-09 21:36:01,330 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:36:01,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 418 events. 91/418 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1990 event pairs, 52 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 559. Up to 197 conditions per place. [2025-01-09 21:36:01,334 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 27 selfloop transitions, 22 changer transitions 1/108 dead transitions. [2025-01-09 21:36:01,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 108 transitions, 321 flow [2025-01-09 21:36:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2025-01-09 21:36:01,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2025-01-09 21:36:01,344 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 6 states and 405 transitions. [2025-01-09 21:36:01,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 108 transitions, 321 flow [2025-01-09 21:36:01,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 108 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:01,350 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 329 flow [2025-01-09 21:36:01,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2025-01-09 21:36:01,354 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2025-01-09 21:36:01,354 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 329 flow [2025-01-09 21:36:01,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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:36:01,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:01,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:01,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:36:01,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:01,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2079786684, now seen corresponding path program 1 times [2025-01-09 21:36:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071834763] [2025-01-09 21:36:01,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:01,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:01,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:36:01,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:36:01,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:01,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:01,443 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:36:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071834763] [2025-01-09 21:36:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071834763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620013867] [2025-01-09 21:36:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:01,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:01,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:01,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:01,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 88 [2025-01-09 21:36:01,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 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:36:01,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:01,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 88 [2025-01-09 21:36:01,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:01,594 INFO L124 PetriNetUnfolderBase]: 40/253 cut-off events. [2025-01-09 21:36:01,594 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:36:01,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 253 events. 40/253 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 835 event pairs, 4 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 333. Up to 50 conditions per place. [2025-01-09 21:36:01,596 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 11 selfloop transitions, 2 changer transitions 5/112 dead transitions. [2025-01-09 21:36:01,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 375 flow [2025-01-09 21:36:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 463 transitions. [2025-01-09 21:36:01,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8768939393939394 [2025-01-09 21:36:01,598 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 329 flow. Second operand 6 states and 463 transitions. [2025-01-09 21:36:01,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 375 flow [2025-01-09 21:36:01,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 112 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:01,601 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 347 flow [2025-01-09 21:36:01,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-01-09 21:36:01,602 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 18 predicate places. [2025-01-09 21:36:01,602 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 347 flow [2025-01-09 21:36:01,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 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:36:01,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:01,602 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] [2025-01-09 21:36:01,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:36:01,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:01,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1058499262, now seen corresponding path program 1 times [2025-01-09 21:36:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985611096] [2025-01-09 21:36:01,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:01,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:36:01,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:36:01,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:01,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:01,827 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:36:01,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:01,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985611096] [2025-01-09 21:36:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985611096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:01,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:01,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760499909] [2025-01-09 21:36:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:01,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:01,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:01,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:01,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:01,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-01-09 21:36:01,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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:36:01,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:01,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-01-09 21:36:01,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:02,039 INFO L124 PetriNetUnfolderBase]: 109/469 cut-off events. [2025-01-09 21:36:02,039 INFO L125 PetriNetUnfolderBase]: For 99/102 co-relation queries the response was YES. [2025-01-09 21:36:02,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 469 events. 109/469 cut-off events. For 99/102 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2294 event pairs, 36 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 886. Up to 225 conditions per place. [2025-01-09 21:36:02,042 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 46 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2025-01-09 21:36:02,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 557 flow [2025-01-09 21:36:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2025-01-09 21:36:02,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7651515151515151 [2025-01-09 21:36:02,043 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 347 flow. Second operand 6 states and 404 transitions. [2025-01-09 21:36:02,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 557 flow [2025-01-09 21:36:02,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 128 transitions, 543 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-09 21:36:02,047 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 515 flow [2025-01-09 21:36:02,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2025-01-09 21:36:02,048 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2025-01-09 21:36:02,048 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 515 flow [2025-01-09 21:36:02,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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:36:02,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:02,048 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] [2025-01-09 21:36:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:36:02,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 378827499, now seen corresponding path program 1 times [2025-01-09 21:36:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38734733] [2025-01-09 21:36:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:02,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:36:02,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:36:02,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:02,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:02,292 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:36:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:02,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38734733] [2025-01-09 21:36:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38734733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:02,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73153798] [2025-01-09 21:36:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:02,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:02,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:02,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:02,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 88 [2025-01-09 21:36:02,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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:36:02,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:02,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 88 [2025-01-09 21:36:02,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:02,505 INFO L124 PetriNetUnfolderBase]: 140/585 cut-off events. [2025-01-09 21:36:02,506 INFO L125 PetriNetUnfolderBase]: For 340/365 co-relation queries the response was YES. [2025-01-09 21:36:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 585 events. 140/585 cut-off events. For 340/365 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3046 event pairs, 14 based on Foata normal form. 4/562 useless extension candidates. Maximal degree in co-relation 1382. Up to 232 conditions per place. [2025-01-09 21:36:02,509 INFO L140 encePairwiseOnDemand]: 74/88 looper letters, 46 selfloop transitions, 57 changer transitions 8/176 dead transitions. [2025-01-09 21:36:02,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 963 flow [2025-01-09 21:36:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2025-01-09 21:36:02,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977272727272727 [2025-01-09 21:36:02,511 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 515 flow. Second operand 6 states and 474 transitions. [2025-01-09 21:36:02,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 963 flow [2025-01-09 21:36:02,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 176 transitions, 925 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:02,516 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 981 flow [2025-01-09 21:36:02,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=119, PETRI_TRANSITIONS=168} [2025-01-09 21:36:02,516 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 30 predicate places. [2025-01-09 21:36:02,516 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 981 flow [2025-01-09 21:36:02,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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:36:02,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:02,517 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] [2025-01-09 21:36:02,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:36:02,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash -965253396, now seen corresponding path program 1 times [2025-01-09 21:36:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682149656] [2025-01-09 21:36:02,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:02,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:36:02,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:36:02,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:02,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:02,770 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:36:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682149656] [2025-01-09 21:36:02,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682149656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:02,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:02,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:02,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63896648] [2025-01-09 21:36:02,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:02,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:02,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:02,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:02,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2025-01-09 21:36:02,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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:36:02,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:02,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2025-01-09 21:36:02,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:02,961 INFO L124 PetriNetUnfolderBase]: 125/536 cut-off events. [2025-01-09 21:36:02,961 INFO L125 PetriNetUnfolderBase]: For 639/656 co-relation queries the response was YES. [2025-01-09 21:36:02,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 536 events. 125/536 cut-off events. For 639/656 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2801 event pairs, 6 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 1501. Up to 135 conditions per place. [2025-01-09 21:36:02,965 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 55 selfloop transitions, 0 changer transitions 15/167 dead transitions. [2025-01-09 21:36:02,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 1105 flow [2025-01-09 21:36:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 410 transitions. [2025-01-09 21:36:02,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7765151515151515 [2025-01-09 21:36:02,966 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 981 flow. Second operand 6 states and 410 transitions. [2025-01-09 21:36:02,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 1105 flow [2025-01-09 21:36:02,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 1069 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:02,974 INFO L231 Difference]: Finished difference. Result has 115 places, 152 transitions, 908 flow [2025-01-09 21:36:02,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=115, PETRI_TRANSITIONS=152} [2025-01-09 21:36:02,975 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-01-09 21:36:02,975 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 152 transitions, 908 flow [2025-01-09 21:36:02,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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:36:02,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:02,975 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:02,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:36:02,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:02,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -192868993, now seen corresponding path program 1 times [2025-01-09 21:36:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791961432] [2025-01-09 21:36:02,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:02,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:36:02,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:36:02,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:02,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:03,697 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:36:03,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:03,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791961432] [2025-01-09 21:36:03,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791961432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:03,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:03,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:36:03,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088814554] [2025-01-09 21:36:03,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:03,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:36:03,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:03,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:36:03,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:36:04,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 88 [2025-01-09 21:36:04,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 152 transitions, 908 flow. Second operand has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 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:36:04,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:04,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 88 [2025-01-09 21:36:04,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:05,139 INFO L124 PetriNetUnfolderBase]: 209/704 cut-off events. [2025-01-09 21:36:05,140 INFO L125 PetriNetUnfolderBase]: For 898/913 co-relation queries the response was YES. [2025-01-09 21:36:05,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 704 events. 209/704 cut-off events. For 898/913 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3640 event pairs, 9 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 2382. Up to 301 conditions per place. [2025-01-09 21:36:05,145 INFO L140 encePairwiseOnDemand]: 70/88 looper letters, 128 selfloop transitions, 66 changer transitions 0/234 dead transitions. [2025-01-09 21:36:05,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 234 transitions, 1876 flow [2025-01-09 21:36:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 21:36:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 21:36:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 976 transitions. [2025-01-09 21:36:05,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931818181818182 [2025-01-09 21:36:05,149 INFO L175 Difference]: Start difference. First operand has 115 places, 152 transitions, 908 flow. Second operand 16 states and 976 transitions. [2025-01-09 21:36:05,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 234 transitions, 1876 flow [2025-01-09 21:36:05,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 234 transitions, 1874 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:05,160 INFO L231 Difference]: Finished difference. Result has 120 places, 193 transitions, 1495 flow [2025-01-09 21:36:05,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1495, PETRI_PLACES=120, PETRI_TRANSITIONS=193} [2025-01-09 21:36:05,161 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2025-01-09 21:36:05,161 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 193 transitions, 1495 flow [2025-01-09 21:36:05,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 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:36:05,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:05,162 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:05,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:36:05,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:05,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash -487352013, now seen corresponding path program 1 times [2025-01-09 21:36:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:05,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511785853] [2025-01-09 21:36:05,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:05,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:36:05,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:36:05,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:05,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:05,754 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:36:05,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511785853] [2025-01-09 21:36:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511785853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:36:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301847660] [2025-01-09 21:36:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:36:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:05,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:36:05,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:36:06,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2025-01-09 21:36:06,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 193 transitions, 1495 flow. Second operand has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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:36:06,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:06,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2025-01-09 21:36:06,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:06,533 INFO L124 PetriNetUnfolderBase]: 214/744 cut-off events. [2025-01-09 21:36:06,533 INFO L125 PetriNetUnfolderBase]: For 1764/1795 co-relation queries the response was YES. [2025-01-09 21:36:06,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 744 events. 214/744 cut-off events. For 1764/1795 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4006 event pairs, 15 based on Foata normal form. 4/747 useless extension candidates. Maximal degree in co-relation 2911. Up to 395 conditions per place. [2025-01-09 21:36:06,538 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 159 selfloop transitions, 37 changer transitions 0/241 dead transitions. [2025-01-09 21:36:06,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 241 transitions, 2231 flow [2025-01-09 21:36:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:36:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:36:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 911 transitions. [2025-01-09 21:36:06,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.739448051948052 [2025-01-09 21:36:06,541 INFO L175 Difference]: Start difference. First operand has 120 places, 193 transitions, 1495 flow. Second operand 14 states and 911 transitions. [2025-01-09 21:36:06,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 241 transitions, 2231 flow [2025-01-09 21:36:06,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 241 transitions, 2163 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-09 21:36:06,554 INFO L231 Difference]: Finished difference. Result has 139 places, 221 transitions, 1835 flow [2025-01-09 21:36:06,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1835, PETRI_PLACES=139, PETRI_TRANSITIONS=221} [2025-01-09 21:36:06,554 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 50 predicate places. [2025-01-09 21:36:06,554 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 221 transitions, 1835 flow [2025-01-09 21:36:06,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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:36:06,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:06,555 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:06,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:36:06,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:06,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1109803413, now seen corresponding path program 2 times [2025-01-09 21:36:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:06,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524516641] [2025-01-09 21:36:06,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:36:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:06,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:36:06,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:36:06,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:36:06,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:07,107 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:36:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524516641] [2025-01-09 21:36:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524516641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:36:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175263743] [2025-01-09 21:36:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:36:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:07,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:36:07,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:36:07,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 88 [2025-01-09 21:36:07,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 221 transitions, 1835 flow. Second operand has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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:36:07,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:07,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 88 [2025-01-09 21:36:07,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:08,281 INFO L124 PetriNetUnfolderBase]: 237/840 cut-off events. [2025-01-09 21:36:08,281 INFO L125 PetriNetUnfolderBase]: For 2811/2844 co-relation queries the response was YES. [2025-01-09 21:36:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 840 events. 237/840 cut-off events. For 2811/2844 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4788 event pairs, 14 based on Foata normal form. 6/845 useless extension candidates. Maximal degree in co-relation 3532. Up to 389 conditions per place. [2025-01-09 21:36:08,289 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 162 selfloop transitions, 77 changer transitions 0/292 dead transitions. [2025-01-09 21:36:08,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 292 transitions, 3005 flow [2025-01-09 21:36:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 21:36:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-09 21:36:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1435 transitions. [2025-01-09 21:36:08,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412190082644629 [2025-01-09 21:36:08,295 INFO L175 Difference]: Start difference. First operand has 139 places, 221 transitions, 1835 flow. Second operand 22 states and 1435 transitions. [2025-01-09 21:36:08,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 292 transitions, 3005 flow [2025-01-09 21:36:08,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 292 transitions, 2927 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:08,316 INFO L231 Difference]: Finished difference. Result has 171 places, 273 transitions, 2575 flow [2025-01-09 21:36:08,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2575, PETRI_PLACES=171, PETRI_TRANSITIONS=273} [2025-01-09 21:36:08,318 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 82 predicate places. [2025-01-09 21:36:08,318 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 273 transitions, 2575 flow [2025-01-09 21:36:08,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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:36:08,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:08,319 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:08,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:36:08,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1820359101, now seen corresponding path program 3 times [2025-01-09 21:36:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313487660] [2025-01-09 21:36:08,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:36:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:08,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:36:08,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:36:08,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 21:36:08,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313487660] [2025-01-09 21:36:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313487660] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:36:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354644282] [2025-01-09 21:36:08,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:36:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:36:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:36:08,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:36:08,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:36:08,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:36:09,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:36:09,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 21:36:09,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:09,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 21:36:09,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:36:09,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:36:09,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 21:36:09,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 21:36:09,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-01-09 21:36:09,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:36:09,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:36:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2025-01-09 21:36:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:09,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:36:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354644282] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:36:19,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:36:19,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 11] total 35 [2025-01-09 21:36:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633685711] [2025-01-09 21:36:19,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:36:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 21:36:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:19,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 21:36:19,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1095, Unknown=3, NotChecked=0, Total=1260 [2025-01-09 21:36:22,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:36:28,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:36:30,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:36:33,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:36:37,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 88 [2025-01-09 21:36:37,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 273 transitions, 2575 flow. Second operand has 36 states, 36 states have (on average 56.111111111111114) internal successors, (2020), 36 states have internal predecessors, (2020), 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:36:37,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:37,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 88 [2025-01-09 21:36:37,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:40,217 INFO L124 PetriNetUnfolderBase]: 288/1019 cut-off events. [2025-01-09 21:36:40,217 INFO L125 PetriNetUnfolderBase]: For 4346/4419 co-relation queries the response was YES. [2025-01-09 21:36:40,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 1019 events. 288/1019 cut-off events. For 4346/4419 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6209 event pairs, 21 based on Foata normal form. 17/1033 useless extension candidates. Maximal degree in co-relation 4558. Up to 446 conditions per place. [2025-01-09 21:36:40,226 INFO L140 encePairwiseOnDemand]: 62/88 looper letters, 191 selfloop transitions, 114 changer transitions 0/352 dead transitions. [2025-01-09 21:36:40,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 352 transitions, 4079 flow [2025-01-09 21:36:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:36:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:36:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1730 transitions. [2025-01-09 21:36:40,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553030303030303 [2025-01-09 21:36:40,231 INFO L175 Difference]: Start difference. First operand has 171 places, 273 transitions, 2575 flow. Second operand 30 states and 1730 transitions. [2025-01-09 21:36:40,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 352 transitions, 4079 flow [2025-01-09 21:36:40,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 352 transitions, 3956 flow, removed 49 selfloop flow, removed 4 redundant places. [2025-01-09 21:36:40,262 INFO L231 Difference]: Finished difference. Result has 211 places, 323 transitions, 3513 flow [2025-01-09 21:36:40,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3513, PETRI_PLACES=211, PETRI_TRANSITIONS=323} [2025-01-09 21:36:40,264 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 122 predicate places. [2025-01-09 21:36:40,264 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 323 transitions, 3513 flow [2025-01-09 21:36:40,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 56.111111111111114) internal successors, (2020), 36 states have internal predecessors, (2020), 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:36:40,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:40,265 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:40,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:36:40,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:36:40,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:36:40,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1554435967, now seen corresponding path program 4 times [2025-01-09 21:36:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073818023] [2025-01-09 21:36:40,473 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:36:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:40,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:36:40,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-01-09 21:36:40,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:36:40,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073818023] [2025-01-09 21:36:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073818023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:36:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776765198] [2025-01-09 21:36:41,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:36:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:36:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:36:41,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:36:41,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:36:41,179 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:36:41,195 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-01-09 21:36:41,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:36:41,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:41,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 21:36:41,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:36:41,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:36:41,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 21:36:41,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 21:36:41,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 21:36:41,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:36:41,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:36:41,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:36:41,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:36:41,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:36:41,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2025-01-09 21:36:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:41,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:37:02,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse2 0) .cse5 0)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~is~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_26| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_26| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_26| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_26| .cse3))))))) is different from false [2025-01-09 21:37:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776765198] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:37:03,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:37:03,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2025-01-09 21:37:03,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53948395] [2025-01-09 21:37:03,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:37:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 21:37:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:03,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 21:37:03,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=727, Unknown=5, NotChecked=56, Total=930 [2025-01-09 21:37:03,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 88 [2025-01-09 21:37:03,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 323 transitions, 3513 flow. Second operand has 31 states, 31 states have (on average 47.354838709677416) internal successors, (1468), 31 states have internal predecessors, (1468), 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:37:03,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:03,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 88 [2025-01-09 21:37:03,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:05,571 INFO L124 PetriNetUnfolderBase]: 411/1425 cut-off events. [2025-01-09 21:37:05,571 INFO L125 PetriNetUnfolderBase]: For 8302/8314 co-relation queries the response was YES. [2025-01-09 21:37:05,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6901 conditions, 1425 events. 411/1425 cut-off events. For 8302/8314 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9657 event pairs, 50 based on Foata normal form. 15/1437 useless extension candidates. Maximal degree in co-relation 6836. Up to 635 conditions per place. [2025-01-09 21:37:05,582 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 283 selfloop transitions, 111 changer transitions 0/431 dead transitions. [2025-01-09 21:37:05,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 431 transitions, 5452 flow [2025-01-09 21:37:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:37:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:37:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 979 transitions. [2025-01-09 21:37:05,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855263157894737 [2025-01-09 21:37:05,584 INFO L175 Difference]: Start difference. First operand has 211 places, 323 transitions, 3513 flow. Second operand 19 states and 979 transitions. [2025-01-09 21:37:05,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 431 transitions, 5452 flow [2025-01-09 21:37:05,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 431 transitions, 5269 flow, removed 36 selfloop flow, removed 8 redundant places. [2025-01-09 21:37:05,629 INFO L231 Difference]: Finished difference. Result has 228 places, 362 transitions, 4388 flow [2025-01-09 21:37:05,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4388, PETRI_PLACES=228, PETRI_TRANSITIONS=362} [2025-01-09 21:37:05,630 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 139 predicate places. [2025-01-09 21:37:05,630 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 362 transitions, 4388 flow [2025-01-09 21:37:05,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 47.354838709677416) internal successors, (1468), 31 states have internal predecessors, (1468), 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:37:05,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:05,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:05,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:37:05,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:05,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:37:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2081477015, now seen corresponding path program 5 times [2025-01-09 21:37:05,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:05,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530324573] [2025-01-09 21:37:05,832 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:37:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:05,840 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:37:05,846 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:37:05,847 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:37:05,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530324573] [2025-01-09 21:37:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530324573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:37:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514066614] [2025-01-09 21:37:06,376 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:37:06,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:06,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:06,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:06,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:37:06,439 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:37:06,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:37:06,458 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:37:06,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:06,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 21:37:06,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:06,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:37:06,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 21:37:06,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 21:37:06,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 21:37:06,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:37:06,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:37:06,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:37:06,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:37:06,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:06,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2025-01-09 21:37:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:06,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:37:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:19,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514066614] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:37:19,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:37:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-01-09 21:37:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840796461] [2025-01-09 21:37:19,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:37:19,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 21:37:19,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:19,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 21:37:19,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=740, Unknown=1, NotChecked=0, Total=870 [2025-01-09 21:37:25,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:37:32,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:37:33,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-01-09 21:37:33,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 362 transitions, 4388 flow. Second operand has 30 states, 30 states have (on average 60.53333333333333) internal successors, (1816), 30 states have internal predecessors, (1816), 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:37:33,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:33,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-01-09 21:37:33,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand