./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:06:55,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:06:55,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:06:55,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:06:55,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:06:55,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:06:55,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:06:55,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:06:55,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:06:55,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:06:55,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:06:55,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:06:55,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:06:55,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:06:55,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:06:55,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:06:55,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:06:55,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:06:55,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:06:55,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:06:55,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:06:55,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:06:55,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:06:55,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:55,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:06:55,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:06:55,507 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/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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2025-03-17 11:06:55,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:06:55,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:06:55,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:06:55,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:06:55,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:06:55,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-03-17 11:06:56,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49277404/f7d3a979652e4a118fae71e459011d23/FLAGbae36d9fc [2025-03-17 11:06:57,205 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:06:57,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-03-17 11:06:57,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49277404/f7d3a979652e4a118fae71e459011d23/FLAGbae36d9fc [2025-03-17 11:06:57,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49277404/f7d3a979652e4a118fae71e459011d23 [2025-03-17 11:06:57,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:06:57,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:06:57,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:57,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:06:57,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:06:57,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f7d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57, skipping insertion in model container [2025-03-17 11:06:57,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:06:57,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:57,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:06:57,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:57,743 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:06:57,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57 WrapperNode [2025-03-17 11:06:57,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:57,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:57,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:06:57,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:06:57,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,791 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 243 [2025-03-17 11:06:57,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:57,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:06:57,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:06:57,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:06:57,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:06:57,833 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:06:57,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:06:57,833 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:06:57,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (1/1) ... [2025-03-17 11:06:57,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:57,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:57,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:06:57,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:06:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:06:57,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:06:57,881 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:06:57,881 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:06:57,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:06:57,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:06:57,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:06:57,882 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:06:58,000 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:06:58,002 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:06:58,390 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:06:58,390 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:06:58,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:06:58,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:06:58,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:58 BoogieIcfgContainer [2025-03-17 11:06:58,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:06:58,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:06:58,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:06:58,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:06:58,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:06:57" (1/3) ... [2025-03-17 11:06:58,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68af97ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:58, skipping insertion in model container [2025-03-17 11:06:58,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:57" (2/3) ... [2025-03-17 11:06:58,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68af97ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:58, skipping insertion in model container [2025-03-17 11:06:58,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:58" (3/3) ... [2025-03-17 11:06:58,413 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2025-03-17 11:06:58,424 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:06:58,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_26-alloc_region_rc.i that has 2 procedures, 272 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-03-17 11:06:58,427 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:06:58,488 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:06:58,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 273 transitions, 550 flow [2025-03-17 11:06:58,599 INFO L124 PetriNetUnfolderBase]: 2/272 cut-off events. [2025-03-17 11:06:58,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:58,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 2/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 278 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2025-03-17 11:06:58,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 273 transitions, 550 flow [2025-03-17 11:06:58,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 272 transitions, 547 flow [2025-03-17 11:06:58,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:06:58,631 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;@243fd2ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:06:58,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-17 11:06:58,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:06:58,637 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-17 11:06:58,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:58,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:58,637 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-03-17 11:06:58,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:06:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash 754091236, now seen corresponding path program 1 times [2025-03-17 11:06:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512489353] [2025-03-17 11:06:58,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:06:58,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:06:58,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:58,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:59,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:59,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512489353] [2025-03-17 11:06:59,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512489353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:59,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:59,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789953561] [2025-03-17 11:06:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:59,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:59,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:59,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:59,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 273 [2025-03-17 11:06:59,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 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-03-17 11:06:59,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:59,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 273 [2025-03-17 11:06:59,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:00,333 INFO L124 PetriNetUnfolderBase]: 1377/5015 cut-off events. [2025-03-17 11:07:00,333 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:07:00,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 5015 events. 1377/5015 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 37554 event pairs, 1344 based on Foata normal form. 36/4687 useless extension candidates. Maximal degree in co-relation 7712. Up to 2785 conditions per place. [2025-03-17 11:07:00,356 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 92 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2025-03-17 11:07:00,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 270 transitions, 737 flow [2025-03-17 11:07:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1143 transitions. [2025-03-17 11:07:00,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6978021978021978 [2025-03-17 11:07:00,375 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 547 flow. Second operand 6 states and 1143 transitions. [2025-03-17 11:07:00,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 270 transitions, 737 flow [2025-03-17 11:07:00,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 270 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:07:00,383 INFO L231 Difference]: Finished difference. Result has 277 places, 270 transitions, 552 flow [2025-03-17 11:07:00,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=270} [2025-03-17 11:07:00,387 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 3 predicate places. [2025-03-17 11:07:00,387 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 270 transitions, 552 flow [2025-03-17 11:07:00,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 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-03-17 11:07:00,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:00,388 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-03-17 11:07:00,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:07:00,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2134975293, now seen corresponding path program 1 times [2025-03-17 11:07:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205922814] [2025-03-17 11:07:00,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:00,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:07:00,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:07:00,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:00,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:07:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205922814] [2025-03-17 11:07:00,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205922814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:00,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:00,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:07:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778373416] [2025-03-17 11:07:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:00,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:07:00,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:00,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:07:00,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:07:01,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 273 [2025-03-17 11:07:01,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 270 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 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-03-17 11:07:01,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:01,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 273 [2025-03-17 11:07:01,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:01,640 INFO L124 PetriNetUnfolderBase]: 762/4094 cut-off events. [2025-03-17 11:07:01,640 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:07:01,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5678 conditions, 4094 events. 762/4094 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 31543 event pairs, 460 based on Foata normal form. 0/3734 useless extension candidates. Maximal degree in co-relation 5631. Up to 1372 conditions per place. [2025-03-17 11:07:01,654 INFO L140 encePairwiseOnDemand]: 241/273 looper letters, 81 selfloop transitions, 90 changer transitions 0/370 dead transitions. [2025-03-17 11:07:01,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 370 transitions, 1094 flow [2025-03-17 11:07:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-17 11:07:01,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418803418803419 [2025-03-17 11:07:01,657 INFO L175 Difference]: Start difference. First operand has 277 places, 270 transitions, 552 flow. Second operand 6 states and 1379 transitions. [2025-03-17 11:07:01,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 370 transitions, 1094 flow [2025-03-17 11:07:01,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 370 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:07:01,665 INFO L231 Difference]: Finished difference. Result has 281 places, 353 transitions, 1118 flow [2025-03-17 11:07:01,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1118, PETRI_PLACES=281, PETRI_TRANSITIONS=353} [2025-03-17 11:07:01,666 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places. [2025-03-17 11:07:01,666 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 353 transitions, 1118 flow [2025-03-17 11:07:01,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 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-03-17 11:07:01,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:01,667 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] [2025-03-17 11:07:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:07:01,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 990496985, now seen corresponding path program 1 times [2025-03-17 11:07:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066282381] [2025-03-17 11:07:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:01,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:07:01,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:07:01,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:01,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:07:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066282381] [2025-03-17 11:07:01,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066282381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:01,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:01,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:07:01,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336711545] [2025-03-17 11:07:01,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:01,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:07:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:01,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:07:01,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:07:02,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273 [2025-03-17 11:07:02,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 353 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-03-17 11:07:02,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:02,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273 [2025-03-17 11:07:02,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:03,062 INFO L124 PetriNetUnfolderBase]: 2110/7422 cut-off events. [2025-03-17 11:07:03,062 INFO L125 PetriNetUnfolderBase]: For 1549/1554 co-relation queries the response was YES. [2025-03-17 11:07:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13852 conditions, 7422 events. 2110/7422 cut-off events. For 1549/1554 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 60004 event pairs, 1264 based on Foata normal form. 0/6804 useless extension candidates. Maximal degree in co-relation 13747. Up to 4041 conditions per place. [2025-03-17 11:07:03,088 INFO L140 encePairwiseOnDemand]: 232/273 looper letters, 187 selfloop transitions, 123 changer transitions 0/485 dead transitions. [2025-03-17 11:07:03,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 485 transitions, 2162 flow [2025-03-17 11:07:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-03-17 11:07:03,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881562881562881 [2025-03-17 11:07:03,095 INFO L175 Difference]: Start difference. First operand has 281 places, 353 transitions, 1118 flow. Second operand 6 states and 1291 transitions. [2025-03-17 11:07:03,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 485 transitions, 2162 flow [2025-03-17 11:07:03,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 485 transitions, 2162 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:07:03,110 INFO L231 Difference]: Finished difference. Result has 290 places, 469 transitions, 2070 flow [2025-03-17 11:07:03,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2070, PETRI_PLACES=290, PETRI_TRANSITIONS=469} [2025-03-17 11:07:03,111 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 16 predicate places. [2025-03-17 11:07:03,111 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 469 transitions, 2070 flow [2025-03-17 11:07:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-03-17 11:07:03,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:03,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:07:03,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:03,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1628414631, now seen corresponding path program 1 times [2025-03-17 11:07:03,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:03,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848091297] [2025-03-17 11:07:03,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:03,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:07:03,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:07:03,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:03,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:03,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848091297] [2025-03-17 11:07:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848091297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:03,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:07:03,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723768627] [2025-03-17 11:07:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:03,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:07:03,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:03,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:07:03,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:07:03,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273 [2025-03-17 11:07:03,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 469 transitions, 2070 flow. Second operand has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-03-17 11:07:03,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:03,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273 [2025-03-17 11:07:03,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:04,644 INFO L124 PetriNetUnfolderBase]: 2412/8367 cut-off events. [2025-03-17 11:07:04,645 INFO L125 PetriNetUnfolderBase]: For 3686/3697 co-relation queries the response was YES. [2025-03-17 11:07:04,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17821 conditions, 8367 events. 2412/8367 cut-off events. For 3686/3697 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 68180 event pairs, 1292 based on Foata normal form. 0/7723 useless extension candidates. Maximal degree in co-relation 17702. Up to 4367 conditions per place. [2025-03-17 11:07:04,677 INFO L140 encePairwiseOnDemand]: 232/273 looper letters, 299 selfloop transitions, 123 changer transitions 0/601 dead transitions. [2025-03-17 11:07:04,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 601 transitions, 3562 flow [2025-03-17 11:07:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-03-17 11:07:04,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881562881562881 [2025-03-17 11:07:04,681 INFO L175 Difference]: Start difference. First operand has 290 places, 469 transitions, 2070 flow. Second operand 6 states and 1291 transitions. [2025-03-17 11:07:04,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 601 transitions, 3562 flow [2025-03-17 11:07:04,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 601 transitions, 3402 flow, removed 80 selfloop flow, removed 0 redundant places. [2025-03-17 11:07:04,696 INFO L231 Difference]: Finished difference. Result has 299 places, 585 transitions, 3086 flow [2025-03-17 11:07:04,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3086, PETRI_PLACES=299, PETRI_TRANSITIONS=585} [2025-03-17 11:07:04,697 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 25 predicate places. [2025-03-17 11:07:04,697 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 585 transitions, 3086 flow [2025-03-17 11:07:04,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-03-17 11:07:04,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:04,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:04,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:07:04,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash -992782775, now seen corresponding path program 1 times [2025-03-17 11:07:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133426262] [2025-03-17 11:07:04,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:04,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 11:07:04,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 11:07:04,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:04,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133426262] [2025-03-17 11:07:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133426262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:07:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196159134] [2025-03-17 11:07:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:05,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:07:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:05,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:07:05,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:07:05,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273 [2025-03-17 11:07:05,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 585 transitions, 3086 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-03-17 11:07:05,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:05,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273 [2025-03-17 11:07:05,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:06,608 INFO L124 PetriNetUnfolderBase]: 2734/9162 cut-off events. [2025-03-17 11:07:06,608 INFO L125 PetriNetUnfolderBase]: For 5360/5426 co-relation queries the response was YES. [2025-03-17 11:07:06,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21659 conditions, 9162 events. 2734/9162 cut-off events. For 5360/5426 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 75204 event pairs, 1246 based on Foata normal form. 0/8495 useless extension candidates. Maximal degree in co-relation 21527. Up to 4881 conditions per place. [2025-03-17 11:07:06,647 INFO L140 encePairwiseOnDemand]: 230/273 looper letters, 360 selfloop transitions, 180 changer transitions 0/768 dead transitions. [2025-03-17 11:07:06,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 768 transitions, 4754 flow [2025-03-17 11:07:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions. [2025-03-17 11:07:06,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168498168498168 [2025-03-17 11:07:06,651 INFO L175 Difference]: Start difference. First operand has 299 places, 585 transitions, 3086 flow. Second operand 6 states and 1338 transitions. [2025-03-17 11:07:06,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 768 transitions, 4754 flow [2025-03-17 11:07:06,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 768 transitions, 4358 flow, removed 198 selfloop flow, removed 0 redundant places. [2025-03-17 11:07:06,687 INFO L231 Difference]: Finished difference. Result has 309 places, 752 transitions, 4086 flow [2025-03-17 11:07:06,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4086, PETRI_PLACES=309, PETRI_TRANSITIONS=752} [2025-03-17 11:07:06,688 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 35 predicate places. [2025-03-17 11:07:06,690 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 752 transitions, 4086 flow [2025-03-17 11:07:06,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-03-17 11:07:06,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:06,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:06,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:07:06,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:06,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -874852787, now seen corresponding path program 1 times [2025-03-17 11:07:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144198891] [2025-03-17 11:07:06,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:06,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:07:06,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:07:06,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:06,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:07,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144198891] [2025-03-17 11:07:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144198891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:07,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:07,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:07:07,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795023375] [2025-03-17 11:07:07,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:07,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:07:07,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:07,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:07:07,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:07:07,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273 [2025-03-17 11:07:07,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 752 transitions, 4086 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-03-17 11:07:07,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:07,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273 [2025-03-17 11:07:07,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:08,580 INFO L124 PetriNetUnfolderBase]: 3188/10508 cut-off events. [2025-03-17 11:07:08,580 INFO L125 PetriNetUnfolderBase]: For 8595/8687 co-relation queries the response was YES. [2025-03-17 11:07:08,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27954 conditions, 10508 events. 3188/10508 cut-off events. For 8595/8687 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 87920 event pairs, 1284 based on Foata normal form. 0/9815 useless extension candidates. Maximal degree in co-relation 27817. Up to 5368 conditions per place. [2025-03-17 11:07:08,623 INFO L140 encePairwiseOnDemand]: 230/273 looper letters, 513 selfloop transitions, 180 changer transitions 0/935 dead transitions. [2025-03-17 11:07:08,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 935 transitions, 6354 flow [2025-03-17 11:07:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions. [2025-03-17 11:07:08,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168498168498168 [2025-03-17 11:07:08,627 INFO L175 Difference]: Start difference. First operand has 309 places, 752 transitions, 4086 flow. Second operand 6 states and 1338 transitions. [2025-03-17 11:07:08,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 935 transitions, 6354 flow [2025-03-17 11:07:08,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 935 transitions, 6300 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-17 11:07:08,665 INFO L231 Difference]: Finished difference. Result has 319 places, 919 transitions, 5722 flow [2025-03-17 11:07:08,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=4032, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5722, PETRI_PLACES=319, PETRI_TRANSITIONS=919} [2025-03-17 11:07:08,667 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 45 predicate places. [2025-03-17 11:07:08,668 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 919 transitions, 5722 flow [2025-03-17 11:07:08,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-03-17 11:07:08,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:08,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:08,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:07:08,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:08,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash -44347706, now seen corresponding path program 1 times [2025-03-17 11:07:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:08,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430635489] [2025-03-17 11:07:08,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:08,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:07:08,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:07:08,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:08,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430635489] [2025-03-17 11:07:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430635489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:09,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:07:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065369664] [2025-03-17 11:07:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:09,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:07:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:09,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:07:09,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:07:10,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-03-17 11:07:10,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 919 transitions, 5722 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-03-17 11:07:10,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:10,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-03-17 11:07:10,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:13,127 INFO L124 PetriNetUnfolderBase]: 4111/12732 cut-off events. [2025-03-17 11:07:13,127 INFO L125 PetriNetUnfolderBase]: For 15671/15766 co-relation queries the response was YES. [2025-03-17 11:07:13,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38443 conditions, 12732 events. 4111/12732 cut-off events. For 15671/15766 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 106061 event pairs, 787 based on Foata normal form. 37/12138 useless extension candidates. Maximal degree in co-relation 38294. Up to 4181 conditions per place. [2025-03-17 11:07:13,188 INFO L140 encePairwiseOnDemand]: 216/273 looper letters, 921 selfloop transitions, 276 changer transitions 0/1416 dead transitions. [2025-03-17 11:07:13,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1416 transitions, 11032 flow [2025-03-17 11:07:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 11:07:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-17 11:07:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5542 transitions. [2025-03-17 11:07:13,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6548505258182677 [2025-03-17 11:07:13,198 INFO L175 Difference]: Start difference. First operand has 319 places, 919 transitions, 5722 flow. Second operand 31 states and 5542 transitions. [2025-03-17 11:07:13,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 1416 transitions, 11032 flow [2025-03-17 11:07:13,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1416 transitions, 10672 flow, removed 180 selfloop flow, removed 0 redundant places. [2025-03-17 11:07:13,273 INFO L231 Difference]: Finished difference. Result has 374 places, 1026 transitions, 7334 flow [2025-03-17 11:07:13,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=5362, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7334, PETRI_PLACES=374, PETRI_TRANSITIONS=1026} [2025-03-17 11:07:13,277 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 100 predicate places. [2025-03-17 11:07:13,277 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 1026 transitions, 7334 flow [2025-03-17 11:07:13,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-03-17 11:07:13,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:13,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:07:13,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:13,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash -503343752, now seen corresponding path program 2 times [2025-03-17 11:07:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129230488] [2025-03-17 11:07:13,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:07:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:13,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-17 11:07:13,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 91 of 93 statements. [2025-03-17 11:07:13,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:07:13,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129230488] [2025-03-17 11:07:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129230488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:13,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:07:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454445491] [2025-03-17 11:07:13,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:07:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:13,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:07:13,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:07:15,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-03-17 11:07:15,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1026 transitions, 7334 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-03-17 11:07:15,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:15,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-03-17 11:07:15,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:18,770 INFO L124 PetriNetUnfolderBase]: 5069/15581 cut-off events. [2025-03-17 11:07:18,770 INFO L125 PetriNetUnfolderBase]: For 29266/29601 co-relation queries the response was YES. [2025-03-17 11:07:18,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52364 conditions, 15581 events. 5069/15581 cut-off events. For 29266/29601 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 135037 event pairs, 794 based on Foata normal form. 38/14892 useless extension candidates. Maximal degree in co-relation 52189. Up to 2883 conditions per place. [2025-03-17 11:07:18,861 INFO L140 encePairwiseOnDemand]: 215/273 looper letters, 1340 selfloop transitions, 200 changer transitions 0/1759 dead transitions. [2025-03-17 11:07:18,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1759 transitions, 16168 flow [2025-03-17 11:07:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:07:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 11:07:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3946 transitions. [2025-03-17 11:07:18,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.657009657009657 [2025-03-17 11:07:18,867 INFO L175 Difference]: Start difference. First operand has 374 places, 1026 transitions, 7334 flow. Second operand 22 states and 3946 transitions. [2025-03-17 11:07:18,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1759 transitions, 16168 flow [2025-03-17 11:07:18,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 1759 transitions, 15958 flow, removed 64 selfloop flow, removed 5 redundant places. [2025-03-17 11:07:19,013 INFO L231 Difference]: Finished difference. Result has 404 places, 1170 transitions, 9471 flow [2025-03-17 11:07:19,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=7194, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9471, PETRI_PLACES=404, PETRI_TRANSITIONS=1170} [2025-03-17 11:07:19,014 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 130 predicate places. [2025-03-17 11:07:19,014 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 1170 transitions, 9471 flow [2025-03-17 11:07:19,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-03-17 11:07:19,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:19,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:19,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:07:19,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:19,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1128490616, now seen corresponding path program 1 times [2025-03-17 11:07:19,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:19,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133169265] [2025-03-17 11:07:19,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:19,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:07:19,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:07:19,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:19,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133169265] [2025-03-17 11:07:19,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133169265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:07:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127113662] [2025-03-17 11:07:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:07:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:19,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:07:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:07:20,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-03-17 11:07:20,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1170 transitions, 9471 flow. Second operand has 15 states, 15 states have (on average 159.8) internal successors, (2397), 15 states have internal predecessors, (2397), 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-03-17 11:07:20,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:20,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-03-17 11:07:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:25,722 INFO L124 PetriNetUnfolderBase]: 6150/18346 cut-off events. [2025-03-17 11:07:25,723 INFO L125 PetriNetUnfolderBase]: For 47860/48209 co-relation queries the response was YES. [2025-03-17 11:07:25,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67210 conditions, 18346 events. 6150/18346 cut-off events. For 47860/48209 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 161927 event pairs, 1005 based on Foata normal form. 92/17632 useless extension candidates. Maximal degree in co-relation 67022. Up to 5066 conditions per place. [2025-03-17 11:07:25,844 INFO L140 encePairwiseOnDemand]: 221/273 looper letters, 1517 selfloop transitions, 209 changer transitions 0/1975 dead transitions. [2025-03-17 11:07:25,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 1975 transitions, 20177 flow [2025-03-17 11:07:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:07:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 11:07:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3983 transitions. [2025-03-17 11:07:25,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6631701631701632 [2025-03-17 11:07:25,850 INFO L175 Difference]: Start difference. First operand has 404 places, 1170 transitions, 9471 flow. Second operand 22 states and 3983 transitions. [2025-03-17 11:07:25,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 1975 transitions, 20177 flow [2025-03-17 11:07:26,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 1975 transitions, 19906 flow, removed 109 selfloop flow, removed 2 redundant places. [2025-03-17 11:07:26,145 INFO L231 Difference]: Finished difference. Result has 438 places, 1315 transitions, 11526 flow [2025-03-17 11:07:26,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=9268, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=11526, PETRI_PLACES=438, PETRI_TRANSITIONS=1315} [2025-03-17 11:07:26,147 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 164 predicate places. [2025-03-17 11:07:26,147 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 1315 transitions, 11526 flow [2025-03-17 11:07:26,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.8) internal successors, (2397), 15 states have internal predecessors, (2397), 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-03-17 11:07:26,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:26,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:26,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:07:26,148 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1798521126, now seen corresponding path program 3 times [2025-03-17 11:07:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:26,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386982175] [2025-03-17 11:07:26,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:07:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:26,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-03-17 11:07:26,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:07:26,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:07:26,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:26,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:26,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386982175] [2025-03-17 11:07:26,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386982175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:07:26,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488170097] [2025-03-17 11:07:26,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:07:26,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:07:26,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:07:26,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:07:26,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:07:26,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-03-17 11:07:27,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:07:27,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:07:27,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:27,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 11:07:27,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:07:27,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 11:07:27,105 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:07:27,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:07:27,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03-17 11:07:27,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-03-17 11:07:27,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-03-17 11:07:27,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-03-17 11:07:27,353 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 37 treesize of output 26 [2025-03-17 11:07:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:27,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:07:29,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1))))))) is different from false [2025-03-17 11:07:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488170097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:07:32,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:07:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-03-17 11:07:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551459353] [2025-03-17 11:07:32,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:07:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:07:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:32,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:07:32,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=730, Unknown=31, NotChecked=56, Total=930 [2025-03-17 11:07:33,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2025-03-17 11:07:33,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 1315 transitions, 11526 flow. Second operand has 31 states, 31 states have (on average 99.64516129032258) internal successors, (3089), 31 states have internal predecessors, (3089), 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-03-17 11:07:33,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:33,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2025-03-17 11:07:33,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:43,072 INFO L124 PetriNetUnfolderBase]: 12329/30846 cut-off events. [2025-03-17 11:07:43,072 INFO L125 PetriNetUnfolderBase]: For 98221/98267 co-relation queries the response was YES. [2025-03-17 11:07:43,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120464 conditions, 30846 events. 12329/30846 cut-off events. For 98221/98267 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 270244 event pairs, 3046 based on Foata normal form. 47/29188 useless extension candidates. Maximal degree in co-relation 120246. Up to 7811 conditions per place. [2025-03-17 11:07:43,444 INFO L140 encePairwiseOnDemand]: 215/273 looper letters, 1916 selfloop transitions, 252 changer transitions 0/2276 dead transitions. [2025-03-17 11:07:43,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 2276 transitions, 23643 flow [2025-03-17 11:07:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:07:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 11:07:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2940 transitions. [2025-03-17 11:07:43,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4682274247491639 [2025-03-17 11:07:43,447 INFO L175 Difference]: Start difference. First operand has 438 places, 1315 transitions, 11526 flow. Second operand 23 states and 2940 transitions. [2025-03-17 11:07:43,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 2276 transitions, 23643 flow [2025-03-17 11:07:44,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 2276 transitions, 23537 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-03-17 11:07:44,232 INFO L231 Difference]: Finished difference. Result has 473 places, 1433 transitions, 14109 flow [2025-03-17 11:07:44,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=11471, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1084, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=14109, PETRI_PLACES=473, PETRI_TRANSITIONS=1433} [2025-03-17 11:07:44,233 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 199 predicate places. [2025-03-17 11:07:44,233 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 1433 transitions, 14109 flow [2025-03-17 11:07:44,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 99.64516129032258) internal successors, (3089), 31 states have internal predecessors, (3089), 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-03-17 11:07:44,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:44,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:44,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:07:44,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 11:07:44,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:07:44,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1175173194, now seen corresponding path program 2 times [2025-03-17 11:07:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845834922] [2025-03-17 11:07:44,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:07:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:44,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-17 11:07:44,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:07:44,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:07:44,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845834922] [2025-03-17 11:07:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845834922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:07:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301759738] [2025-03-17 11:07:44,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:07:44,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:07:44,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:07:44,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:07:44,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:07:45,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-17 11:07:45,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:07:45,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:07:45,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:45,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 11:07:45,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:07:45,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 11:07:45,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:07:45,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:07:45,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03-17 11:07:45,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-03-17 11:07:45,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-03-17 11:07:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-03-17 11:07:45,900 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 37 treesize of output 26 [2025-03-17 11:07:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:45,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:07:45,950 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)))) (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) (+ 3 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|))) is different from false [2025-03-17 11:07:45,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)))) (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)))) (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) .cse1)))))) is different from false [2025-03-17 11:07:45,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|) .cse2 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) .cse2))) (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_842) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false [2025-03-17 11:07:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:07:52,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301759738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:07:52,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:07:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-03-17 11:07:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891299268] [2025-03-17 11:07:52,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:07:52,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:07:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:52,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:07:52,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=660, Unknown=3, NotChecked=162, Total=930 [2025-03-17 11:07:52,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 273 [2025-03-17 11:07:52,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1433 transitions, 14109 flow. Second operand has 31 states, 31 states have (on average 97.70967741935483) internal successors, (3029), 31 states have internal predecessors, (3029), 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-03-17 11:07:52,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:52,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 273 [2025-03-17 11:07:52,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:08:03,434 INFO L124 PetriNetUnfolderBase]: 13860/34507 cut-off events. [2025-03-17 11:08:03,434 INFO L125 PetriNetUnfolderBase]: For 139111/139171 co-relation queries the response was YES. [2025-03-17 11:08:03,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143241 conditions, 34507 events. 13860/34507 cut-off events. For 139111/139171 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 307348 event pairs, 3303 based on Foata normal form. 63/32785 useless extension candidates. Maximal degree in co-relation 143005. Up to 13002 conditions per place. [2025-03-17 11:08:04,004 INFO L140 encePairwiseOnDemand]: 221/273 looper letters, 2087 selfloop transitions, 223 changer transitions 0/2430 dead transitions. [2025-03-17 11:08:04,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 2430 transitions, 27980 flow [2025-03-17 11:08:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:08:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 11:08:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2930 transitions. [2025-03-17 11:08:04,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46663481446090144 [2025-03-17 11:08:04,007 INFO L175 Difference]: Start difference. First operand has 473 places, 1433 transitions, 14109 flow. Second operand 23 states and 2930 transitions. [2025-03-17 11:08:04,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 2430 transitions, 27980 flow [2025-03-17 11:08:05,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 2430 transitions, 27530 flow, removed 158 selfloop flow, removed 6 redundant places. [2025-03-17 11:08:05,321 INFO L231 Difference]: Finished difference. Result has 504 places, 1558 transitions, 16303 flow [2025-03-17 11:08:05,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=13722, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16303, PETRI_PLACES=504, PETRI_TRANSITIONS=1558} [2025-03-17 11:08:05,323 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 230 predicate places. [2025-03-17 11:08:05,323 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 1558 transitions, 16303 flow [2025-03-17 11:08:05,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 97.70967741935483) internal successors, (3029), 31 states have internal predecessors, (3029), 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-03-17 11:08:05,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:08:05,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:08:05,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:08:05,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:08:05,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-17 11:08:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:08:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1713033818, now seen corresponding path program 4 times [2025-03-17 11:08:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:08:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093408734] [2025-03-17 11:08:05,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:08:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:08:05,541 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-17 11:08:05,548 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-03-17 11:08:05,549 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:08:05,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:08:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:08:06,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:08:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093408734] [2025-03-17 11:08:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093408734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:08:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694507111] [2025-03-17 11:08:06,087 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:08:06,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:08:06,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:08:06,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:08:06,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:08:06,191 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-17 11:08:06,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-03-17 11:08:06,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:08:06,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:08:06,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:08:06,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:08:06,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 11:08:06,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:08:06,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:08:06,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03-17 11:08:06,276 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-03-17 11:08:06,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:08:06,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:08:06,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:08:06,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-17 11:08:06,320 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 43 treesize of output 32 [2025-03-17 11:08:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:08:06,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:08:08,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1005 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1005 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1)))))) is different from false [2025-03-17 11:08:08,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|) .cse2 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1005 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse2) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1005 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1005) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|)))))) is different from false [2025-03-17 11:08:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:08:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694507111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:08:14,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:08:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2025-03-17 11:08:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044914511] [2025-03-17 11:08:14,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:08:14,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:08:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:08:14,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:08:14,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=253, Unknown=10, NotChecked=66, Total=380 [2025-03-17 11:08:15,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273 [2025-03-17 11:08:15,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 1558 transitions, 16303 flow. Second operand has 20 states, 20 states have (on average 100.2) internal successors, (2004), 20 states have internal predecessors, (2004), 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-03-17 11:08:15,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:08:15,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273 [2025-03-17 11:08:15,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand