./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/pthread-race-challenges/per-thread-struct.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 b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:06:11,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:06:12,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:06:12,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:06:12,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:06:12,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:06:12,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:06:12,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:06:12,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:06:12,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:06:12,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:06:12,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:06:12,068 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:06:12,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:06:12,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:06:12,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:06:12,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:06:12,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:06:12,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:06:12,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:06:12,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:06:12,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:06:12,077 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:06:12,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:06:12,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:06:12,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:06:12,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:06:12,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:06:12,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:06:12,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:06:12,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:06:12,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:06:12,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:06:12,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:06:12,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:06:12,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:06:12,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:06:12,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:06:12,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:06:12,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:06:12,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:06:12,083 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 [2024-11-09 07:06:12,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:06:12,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:06:12,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:06:12,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:06:12,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:06:12,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-11-09 07:06:13,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:06:14,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:06:14,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-11-09 07:06:14,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0691ad263/9ede21d8ef2a4f569fe511daa993d453/FLAGb82cf5b3e [2024-11-09 07:06:14,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0691ad263/9ede21d8ef2a4f569fe511daa993d453 [2024-11-09 07:06:14,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:06:14,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:06:14,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:06:14,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:06:14,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:06:14,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:06:14" (1/1) ... [2024-11-09 07:06:14,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73574b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:14, skipping insertion in model container [2024-11-09 07:06:14,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:06:14" (1/1) ... [2024-11-09 07:06:14,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:06:15,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:06:15,040 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:06:15,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:06:15,146 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:06:15,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15 WrapperNode [2024-11-09 07:06:15,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:06:15,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:06:15,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:06:15,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:06:15,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,252 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-09 07:06:15,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:06:15,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:06:15,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:06:15,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:06:15,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:06:15,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:06:15,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:06:15,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:06:15,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (1/1) ... [2024-11-09 07:06:15,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:06:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:06:15,327 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) [2024-11-09 07:06:15,329 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 [2024-11-09 07:06:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:06:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:06:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:06:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:06:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 07:06:15,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 07:06:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:06:15,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:06:15,373 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:06:15,490 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:06:15,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:06:15,676 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:06:15,676 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:06:15,695 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:06:15,695 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:06:15,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:06:15 BoogieIcfgContainer [2024-11-09 07:06:15,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:06:15,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:06:15,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:06:15,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:06:15,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:06:14" (1/3) ... [2024-11-09 07:06:15,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454a37b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:06:15, skipping insertion in model container [2024-11-09 07:06:15,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:06:15" (2/3) ... [2024-11-09 07:06:15,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454a37b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:06:15, skipping insertion in model container [2024-11-09 07:06:15,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:06:15" (3/3) ... [2024-11-09 07:06:15,705 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2024-11-09 07:06:15,719 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:06:15,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 07:06:15,719 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:06:15,791 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 07:06:15,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 85 transitions, 177 flow [2024-11-09 07:06:15,878 INFO L124 PetriNetUnfolderBase]: 6/119 cut-off events. [2024-11-09 07:06:15,878 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:06:15,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 119 events. 6/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2024-11-09 07:06:15,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 85 transitions, 177 flow [2024-11-09 07:06:15,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 85 transitions, 177 flow [2024-11-09 07:06:15,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:06:15,908 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;@3f67c209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:06:15,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 07:06:15,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:06:15,928 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-11-09 07:06:15,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:06:15,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:15,929 INFO L204 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] [2024-11-09 07:06:15,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:06:15,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash 707406292, now seen corresponding path program 1 times [2024-11-09 07:06:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:15,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987415084] [2024-11-09 07:06:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987415084] [2024-11-09 07:06:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987415084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:16,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156395721] [2024-11-09 07:06:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:16,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:06:16,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:06:16,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:06:16,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 85 [2024-11-09 07:06:16,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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) [2024-11-09 07:06:16,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:16,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 85 [2024-11-09 07:06:16,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:16,602 INFO L124 PetriNetUnfolderBase]: 1/120 cut-off events. [2024-11-09 07:06:16,602 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:06:16,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 120 events. 1/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 22. Up to 16 conditions per place. [2024-11-09 07:06:16,605 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 11 selfloop transitions, 2 changer transitions 6/87 dead transitions. [2024-11-09 07:06:16,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 87 transitions, 217 flow [2024-11-09 07:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2024-11-09 07:06:16,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8588235294117647 [2024-11-09 07:06:16,627 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 177 flow. Second operand 6 states and 438 transitions. [2024-11-09 07:06:16,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 87 transitions, 217 flow [2024-11-09 07:06:16,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:16,638 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 187 flow [2024-11-09 07:06:16,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-11-09 07:06:16,647 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2024-11-09 07:06:16,648 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 187 flow [2024-11-09 07:06:16,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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) [2024-11-09 07:06:16,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:16,649 INFO L204 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] [2024-11-09 07:06:16,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:06:16,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:06:16,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1690337444, now seen corresponding path program 1 times [2024-11-09 07:06:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005092698] [2024-11-09 07:06:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:16,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005092698] [2024-11-09 07:06:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005092698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:17,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:17,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002696922] [2024-11-09 07:06:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:17,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:17,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 85 [2024-11-09 07:06:17,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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) [2024-11-09 07:06:17,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:17,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 85 [2024-11-09 07:06:17,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:17,553 INFO L124 PetriNetUnfolderBase]: 70/365 cut-off events. [2024-11-09 07:06:17,553 INFO L125 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2024-11-09 07:06:17,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 365 events. 70/365 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1723 event pairs, 32 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 504. Up to 150 conditions per place. [2024-11-09 07:06:17,557 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 23 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-11-09 07:06:17,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 319 flow [2024-11-09 07:06:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2024-11-09 07:06:17,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7725490196078432 [2024-11-09 07:06:17,560 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 187 flow. Second operand 6 states and 394 transitions. [2024-11-09 07:06:17,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 319 flow [2024-11-09 07:06:17,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 305 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-09 07:06:17,564 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 323 flow [2024-11-09 07:06:17,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2024-11-09 07:06:17,565 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2024-11-09 07:06:17,565 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 323 flow [2024-11-09 07:06:17,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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) [2024-11-09 07:06:17,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:17,566 INFO L204 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] [2024-11-09 07:06:17,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:06:17,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:06:17,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -649763536, now seen corresponding path program 1 times [2024-11-09 07:06:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:17,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3130868] [2024-11-09 07:06:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:17,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:17,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3130868] [2024-11-09 07:06:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3130868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:17,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:17,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198435932] [2024-11-09 07:06:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:17,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:17,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:17,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2024-11-09 07:06:17,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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) [2024-11-09 07:06:17,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:17,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2024-11-09 07:06:17,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:18,134 INFO L124 PetriNetUnfolderBase]: 130/487 cut-off events. [2024-11-09 07:06:18,135 INFO L125 PetriNetUnfolderBase]: For 142/176 co-relation queries the response was YES. [2024-11-09 07:06:18,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 487 events. 130/487 cut-off events. For 142/176 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2451 event pairs, 23 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 987. Up to 238 conditions per place. [2024-11-09 07:06:18,142 INFO L140 encePairwiseOnDemand]: 70/85 looper letters, 33 selfloop transitions, 48 changer transitions 7/145 dead transitions. [2024-11-09 07:06:18,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 145 transitions, 641 flow [2024-11-09 07:06:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2024-11-09 07:06:18,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2024-11-09 07:06:18,147 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 323 flow. Second operand 6 states and 435 transitions. [2024-11-09 07:06:18,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 145 transitions, 641 flow [2024-11-09 07:06:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:18,157 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 697 flow [2024-11-09 07:06:18,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=104, PETRI_TRANSITIONS=138} [2024-11-09 07:06:18,158 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2024-11-09 07:06:18,159 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 697 flow [2024-11-09 07:06:18,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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) [2024-11-09 07:06:18,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:18,160 INFO L204 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] [2024-11-09 07:06:18,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:06:18,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:06:18,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash -535742198, now seen corresponding path program 1 times [2024-11-09 07:06:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670465651] [2024-11-09 07:06:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:06:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670465651] [2024-11-09 07:06:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670465651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578265213] [2024-11-09 07:06:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:18,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:18,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 85 [2024-11-09 07:06:18,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 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) [2024-11-09 07:06:18,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:18,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 85 [2024-11-09 07:06:18,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:18,761 INFO L124 PetriNetUnfolderBase]: 142/522 cut-off events. [2024-11-09 07:06:18,762 INFO L125 PetriNetUnfolderBase]: For 548/675 co-relation queries the response was YES. [2024-11-09 07:06:18,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 522 events. 142/522 cut-off events. For 548/675 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2871 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1481. Up to 241 conditions per place. [2024-11-09 07:06:18,769 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 73 selfloop transitions, 25 changer transitions 13/166 dead transitions. [2024-11-09 07:06:18,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 166 transitions, 1080 flow [2024-11-09 07:06:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2024-11-09 07:06:18,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7901960784313725 [2024-11-09 07:06:18,772 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 697 flow. Second operand 6 states and 403 transitions. [2024-11-09 07:06:18,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 166 transitions, 1080 flow [2024-11-09 07:06:18,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 1062 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:18,790 INFO L231 Difference]: Finished difference. Result has 107 places, 153 transitions, 914 flow [2024-11-09 07:06:18,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=107, PETRI_TRANSITIONS=153} [2024-11-09 07:06:18,791 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2024-11-09 07:06:18,791 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 153 transitions, 914 flow [2024-11-09 07:06:18,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 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) [2024-11-09 07:06:18,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:18,792 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:18,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:06:18,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:06:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 225505610, now seen corresponding path program 1 times [2024-11-09 07:06:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817801602] [2024-11-09 07:06:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:06:18,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:06:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:06:18,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:06:18,879 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:06:18,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-09 07:06:18,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-09 07:06:18,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-09 07:06:18,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-09 07:06:18,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-09 07:06:18,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:06:18,884 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 07:06:18,887 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 07:06:18,887 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 07:06:18,926 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 07:06:18,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 104 transitions, 224 flow [2024-11-09 07:06:18,959 INFO L124 PetriNetUnfolderBase]: 11/205 cut-off events. [2024-11-09 07:06:18,960 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:06:18,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 205 events. 11/205 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 395 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2024-11-09 07:06:18,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 104 transitions, 224 flow [2024-11-09 07:06:18,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 104 transitions, 224 flow [2024-11-09 07:06:18,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:06:18,965 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;@3f67c209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:06:18,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 07:06:18,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:06:18,970 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-11-09 07:06:18,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:06:18,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:18,970 INFO L204 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] [2024-11-09 07:06:18,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:18,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1757470764, now seen corresponding path program 1 times [2024-11-09 07:06:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226284194] [2024-11-09 07:06:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226284194] [2024-11-09 07:06:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226284194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377032331] [2024-11-09 07:06:19,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:06:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:06:19,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:06:19,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 104 [2024-11-09 07:06:19,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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) [2024-11-09 07:06:19,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:19,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 104 [2024-11-09 07:06:19,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:19,159 INFO L124 PetriNetUnfolderBase]: 3/203 cut-off events. [2024-11-09 07:06:19,160 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-09 07:06:19,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 203 events. 3/203 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 426 event pairs, 0 based on Foata normal form. 2/195 useless extension candidates. Maximal degree in co-relation 143. Up to 32 conditions per place. [2024-11-09 07:06:19,161 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 14 selfloop transitions, 2 changer transitions 6/107 dead transitions. [2024-11-09 07:06:19,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 272 flow [2024-11-09 07:06:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2024-11-09 07:06:19,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8701923076923077 [2024-11-09 07:06:19,163 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 224 flow. Second operand 6 states and 543 transitions. [2024-11-09 07:06:19,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 272 flow [2024-11-09 07:06:19,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:19,166 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 238 flow [2024-11-09 07:06:19,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2024-11-09 07:06:19,167 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 9 predicate places. [2024-11-09 07:06:19,167 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 238 flow [2024-11-09 07:06:19,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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) [2024-11-09 07:06:19,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:19,168 INFO L204 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] [2024-11-09 07:06:19,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:06:19,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:19,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1786749756, now seen corresponding path program 1 times [2024-11-09 07:06:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:19,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658321286] [2024-11-09 07:06:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:19,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658321286] [2024-11-09 07:06:19,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658321286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:19,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:19,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737634361] [2024-11-09 07:06:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:19,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:19,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:19,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:19,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 104 [2024-11-09 07:06:19,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:06:19,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:19,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 104 [2024-11-09 07:06:19,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:19,896 INFO L124 PetriNetUnfolderBase]: 902/2767 cut-off events. [2024-11-09 07:06:19,896 INFO L125 PetriNetUnfolderBase]: For 186/192 co-relation queries the response was YES. [2024-11-09 07:06:19,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 2767 events. 902/2767 cut-off events. For 186/192 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 21368 event pairs, 529 based on Foata normal form. 0/2526 useless extension candidates. Maximal degree in co-relation 3139. Up to 1384 conditions per place. [2024-11-09 07:06:19,913 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 31 selfloop transitions, 38 changer transitions 0/139 dead transitions. [2024-11-09 07:06:19,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 139 transitions, 457 flow [2024-11-09 07:06:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2024-11-09 07:06:19,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7932692307692307 [2024-11-09 07:06:19,916 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 238 flow. Second operand 6 states and 495 transitions. [2024-11-09 07:06:19,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 139 transitions, 457 flow [2024-11-09 07:06:19,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 445 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 07:06:19,920 INFO L231 Difference]: Finished difference. Result has 115 places, 138 transitions, 480 flow [2024-11-09 07:06:19,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=115, PETRI_TRANSITIONS=138} [2024-11-09 07:06:19,921 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2024-11-09 07:06:19,921 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 138 transitions, 480 flow [2024-11-09 07:06:19,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:06:19,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:19,922 INFO L204 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] [2024-11-09 07:06:19,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:06:19,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:19,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2001006567, now seen corresponding path program 1 times [2024-11-09 07:06:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:19,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079198061] [2024-11-09 07:06:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:19,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:20,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:20,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079198061] [2024-11-09 07:06:20,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079198061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:20,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:20,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:20,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469860088] [2024-11-09 07:06:20,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:20,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:20,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:20,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:20,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:20,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 104 [2024-11-09 07:06:20,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 138 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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) [2024-11-09 07:06:20,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:20,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 104 [2024-11-09 07:06:20,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:21,011 INFO L124 PetriNetUnfolderBase]: 1867/4768 cut-off events. [2024-11-09 07:06:21,012 INFO L125 PetriNetUnfolderBase]: For 1555/1771 co-relation queries the response was YES. [2024-11-09 07:06:21,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10955 conditions, 4768 events. 1867/4768 cut-off events. For 1555/1771 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 37844 event pairs, 439 based on Foata normal form. 0/4460 useless extension candidates. Maximal degree in co-relation 8715. Up to 2583 conditions per place. [2024-11-09 07:06:21,045 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 63 selfloop transitions, 92 changer transitions 0/233 dead transitions. [2024-11-09 07:06:21,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 233 transitions, 1226 flow [2024-11-09 07:06:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2024-11-09 07:06:21,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8701923076923077 [2024-11-09 07:06:21,048 INFO L175 Difference]: Start difference. First operand has 115 places, 138 transitions, 480 flow. Second operand 6 states and 543 transitions. [2024-11-09 07:06:21,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 233 transitions, 1226 flow [2024-11-09 07:06:21,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:21,059 INFO L231 Difference]: Finished difference. Result has 125 places, 225 transitions, 1316 flow [2024-11-09 07:06:21,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1316, PETRI_PLACES=125, PETRI_TRANSITIONS=225} [2024-11-09 07:06:21,061 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 21 predicate places. [2024-11-09 07:06:21,061 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 225 transitions, 1316 flow [2024-11-09 07:06:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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) [2024-11-09 07:06:21,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:21,062 INFO L204 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] [2024-11-09 07:06:21,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:06:21,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:21,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1723336065, now seen corresponding path program 1 times [2024-11-09 07:06:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762917415] [2024-11-09 07:06:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:06:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762917415] [2024-11-09 07:06:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762917415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:21,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080492375] [2024-11-09 07:06:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:21,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:21,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2024-11-09 07:06:21,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 225 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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) [2024-11-09 07:06:21,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:21,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2024-11-09 07:06:21,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:22,441 INFO L124 PetriNetUnfolderBase]: 2321/5745 cut-off events. [2024-11-09 07:06:22,442 INFO L125 PetriNetUnfolderBase]: For 5611/6308 co-relation queries the response was YES. [2024-11-09 07:06:22,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17696 conditions, 5745 events. 2321/5745 cut-off events. For 5611/6308 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 46840 event pairs, 295 based on Foata normal form. 2/5511 useless extension candidates. Maximal degree in co-relation 14366. Up to 3135 conditions per place. [2024-11-09 07:06:22,490 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 145 selfloop transitions, 76 changer transitions 0/298 dead transitions. [2024-11-09 07:06:22,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 2250 flow [2024-11-09 07:06:22,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2024-11-09 07:06:22,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8108974358974359 [2024-11-09 07:06:22,493 INFO L175 Difference]: Start difference. First operand has 125 places, 225 transitions, 1316 flow. Second operand 6 states and 506 transitions. [2024-11-09 07:06:22,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 2250 flow [2024-11-09 07:06:22,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 298 transitions, 2232 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:22,532 INFO L231 Difference]: Finished difference. Result has 135 places, 296 transitions, 2156 flow [2024-11-09 07:06:22,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2156, PETRI_PLACES=135, PETRI_TRANSITIONS=296} [2024-11-09 07:06:22,533 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 31 predicate places. [2024-11-09 07:06:22,533 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 296 transitions, 2156 flow [2024-11-09 07:06:22,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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) [2024-11-09 07:06:22,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:22,534 INFO L204 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] [2024-11-09 07:06:22,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:06:22,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:22,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash -426431938, now seen corresponding path program 1 times [2024-11-09 07:06:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:22,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866297836] [2024-11-09 07:06:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:22,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866297836] [2024-11-09 07:06:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866297836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449044682] [2024-11-09 07:06:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:22,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:22,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:06:22,988 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) [2024-11-09 07:06:22,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:06:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:23,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:06:23,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:23,198 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 [2024-11-09 07:06:23,260 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:06:23,260 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 [2024-11-09 07:06:23,326 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 [2024-11-09 07:06:23,342 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 [2024-11-09 07:06:23,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:23,363 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 [2024-11-09 07:06:23,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:23,394 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 [2024-11-09 07:06:23,460 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 [2024-11-09 07:06:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:23,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:23,506 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-09 07:06:23,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-09 07:06:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:27,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449044682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:06:27,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:06:27,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-09 07:06:27,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369569194] [2024-11-09 07:06:27,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:27,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:06:27,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:06:27,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=219, Unknown=10, NotChecked=62, Total=342 [2024-11-09 07:06:27,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 104 [2024-11-09 07:06:27,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 296 transitions, 2156 flow. Second operand has 19 states, 19 states have (on average 54.89473684210526) internal successors, (1043), 19 states have internal predecessors, (1043), 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) [2024-11-09 07:06:27,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:27,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 104 [2024-11-09 07:06:27,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:34,060 INFO L124 PetriNetUnfolderBase]: 9369/19112 cut-off events. [2024-11-09 07:06:34,060 INFO L125 PetriNetUnfolderBase]: For 29740/29791 co-relation queries the response was YES. [2024-11-09 07:06:34,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62821 conditions, 19112 events. 9369/19112 cut-off events. For 29740/29791 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 169911 event pairs, 471 based on Foata normal form. 257/18601 useless extension candidates. Maximal degree in co-relation 56252. Up to 4911 conditions per place. [2024-11-09 07:06:34,221 INFO L140 encePairwiseOnDemand]: 80/104 looper letters, 898 selfloop transitions, 613 changer transitions 27/1593 dead transitions. [2024-11-09 07:06:34,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1593 transitions, 13755 flow [2024-11-09 07:06:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-09 07:06:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2024-11-09 07:06:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4226 transitions. [2024-11-09 07:06:34,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6251479289940829 [2024-11-09 07:06:34,239 INFO L175 Difference]: Start difference. First operand has 135 places, 296 transitions, 2156 flow. Second operand 65 states and 4226 transitions. [2024-11-09 07:06:34,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1593 transitions, 13755 flow [2024-11-09 07:06:34,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1593 transitions, 13279 flow, removed 238 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:34,418 INFO L231 Difference]: Finished difference. Result has 225 places, 948 transitions, 9073 flow [2024-11-09 07:06:34,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=9073, PETRI_PLACES=225, PETRI_TRANSITIONS=948} [2024-11-09 07:06:34,420 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 121 predicate places. [2024-11-09 07:06:34,420 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 948 transitions, 9073 flow [2024-11-09 07:06:34,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 54.89473684210526) internal successors, (1043), 19 states have internal predecessors, (1043), 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) [2024-11-09 07:06:34,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:34,422 INFO L204 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] [2024-11-09 07:06:34,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:06:34,623 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 [2024-11-09 07:06:34,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:34,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash -149081666, now seen corresponding path program 1 times [2024-11-09 07:06:34,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:34,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141775851] [2024-11-09 07:06:34,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:34,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141775851] [2024-11-09 07:06:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141775851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483909338] [2024-11-09 07:06:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:35,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:06:35,368 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) [2024-11-09 07:06:35,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:06:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:35,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:06:35,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:35,475 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 [2024-11-09 07:06:35,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:06:35,494 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 [2024-11-09 07:06:35,561 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 [2024-11-09 07:06:35,598 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 [2024-11-09 07:06:35,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:35,644 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 [2024-11-09 07:06:35,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:35,707 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 [2024-11-09 07:06:35,922 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 [2024-11-09 07:06:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:35,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:36,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)))) is different from false [2024-11-09 07:06:36,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)))) is different from false [2024-11-09 07:06:36,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_286 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-11-09 07:06:40,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:40,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-11-09 07:06:40,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:40,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2024-11-09 07:06:40,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:06:40,536 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:40,537 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:40,546 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:40,547 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:40,556 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:40,557 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:40,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483909338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:06:40,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:06:40,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29 [2024-11-09 07:06:40,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665692959] [2024-11-09 07:06:40,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:40,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:06:40,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:40,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:06:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=539, Unknown=53, NotChecked=156, Total=870 [2024-11-09 07:06:40,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-11-09 07:06:40,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 948 transitions, 9073 flow. Second operand has 30 states, 30 states have (on average 50.733333333333334) internal successors, (1522), 30 states have internal predecessors, (1522), 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) [2024-11-09 07:06:40,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:40,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-11-09 07:06:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:47,486 INFO L124 PetriNetUnfolderBase]: 10285/21769 cut-off events. [2024-11-09 07:06:47,487 INFO L125 PetriNetUnfolderBase]: For 132039/133414 co-relation queries the response was YES. [2024-11-09 07:06:47,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95929 conditions, 21769 events. 10285/21769 cut-off events. For 132039/133414 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 200524 event pairs, 1228 based on Foata normal form. 236/20952 useless extension candidates. Maximal degree in co-relation 93369. Up to 5166 conditions per place. [2024-11-09 07:06:47,832 INFO L140 encePairwiseOnDemand]: 73/104 looper letters, 1044 selfloop transitions, 517 changer transitions 99/1726 dead transitions. [2024-11-09 07:06:47,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1726 transitions, 19201 flow [2024-11-09 07:06:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-09 07:06:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2024-11-09 07:06:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2572 transitions. [2024-11-09 07:06:47,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6182692307692308 [2024-11-09 07:06:47,840 INFO L175 Difference]: Start difference. First operand has 225 places, 948 transitions, 9073 flow. Second operand 40 states and 2572 transitions. [2024-11-09 07:06:47,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1726 transitions, 19201 flow [2024-11-09 07:06:48,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1726 transitions, 18817 flow, removed 185 selfloop flow, removed 3 redundant places. [2024-11-09 07:06:48,699 INFO L231 Difference]: Finished difference. Result has 279 places, 1190 transitions, 12591 flow [2024-11-09 07:06:48,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=8697, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=12591, PETRI_PLACES=279, PETRI_TRANSITIONS=1190} [2024-11-09 07:06:48,700 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 175 predicate places. [2024-11-09 07:06:48,700 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 1190 transitions, 12591 flow [2024-11-09 07:06:48,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 50.733333333333334) internal successors, (1522), 30 states have internal predecessors, (1522), 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) [2024-11-09 07:06:48,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:48,701 INFO L204 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] [2024-11-09 07:06:48,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:06:48,902 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 [2024-11-09 07:06:48,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:48,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash -612432030, now seen corresponding path program 2 times [2024-11-09 07:06:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557892555] [2024-11-09 07:06:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:49,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557892555] [2024-11-09 07:06:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557892555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462425967] [2024-11-09 07:06:49,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:06:49,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:06:49,317 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) [2024-11-09 07:06:49,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:06:49,415 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:06:49,415 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:06:49,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:06:49,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:49,432 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 [2024-11-09 07:06:49,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:06:49,483 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 [2024-11-09 07:06:49,684 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 [2024-11-09 07:06:49,722 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 [2024-11-09 07:06:49,765 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 [2024-11-09 07:06:49,877 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 [2024-11-09 07:06:49,937 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 [2024-11-09 07:06:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:49,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:50,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)))) is different from false [2024-11-09 07:06:50,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)))))) is different from false [2024-11-09 07:06:50,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse3)) 0)))))) is different from false [2024-11-09 07:06:50,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-11-09 07:06:50,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:50,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-11-09 07:06:50,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:50,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2024-11-09 07:06:50,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:06:50,095 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:50,095 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:50,100 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:50,100 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:50,105 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:50,105 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:50,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462425967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:06:50,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:06:50,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 32 [2024-11-09 07:06:50,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666435921] [2024-11-09 07:06:50,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:50,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:06:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:06:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=706, Unknown=4, NotChecked=228, Total=1056 [2024-11-09 07:06:50,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-11-09 07:06:50,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1190 transitions, 12591 flow. Second operand has 33 states, 33 states have (on average 50.90909090909091) internal successors, (1680), 33 states have internal predecessors, (1680), 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) [2024-11-09 07:06:50,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:50,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-11-09 07:06:50,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:59,965 INFO L124 PetriNetUnfolderBase]: 15597/31763 cut-off events. [2024-11-09 07:06:59,965 INFO L125 PetriNetUnfolderBase]: For 235425/236706 co-relation queries the response was YES. [2024-11-09 07:07:00,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159066 conditions, 31763 events. 15597/31763 cut-off events. For 235425/236706 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 304604 event pairs, 891 based on Foata normal form. 690/30842 useless extension candidates. Maximal degree in co-relation 158562. Up to 8566 conditions per place. [2024-11-09 07:07:00,616 INFO L140 encePairwiseOnDemand]: 78/104 looper letters, 1546 selfloop transitions, 1025 changer transitions 43/2680 dead transitions. [2024-11-09 07:07:00,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 2680 transitions, 34793 flow [2024-11-09 07:07:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-09 07:07:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2024-11-09 07:07:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3333 transitions. [2024-11-09 07:07:00,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.593482905982906 [2024-11-09 07:07:00,626 INFO L175 Difference]: Start difference. First operand has 279 places, 1190 transitions, 12591 flow. Second operand 54 states and 3333 transitions. [2024-11-09 07:07:00,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 2680 transitions, 34793 flow [2024-11-09 07:07:03,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 2680 transitions, 34017 flow, removed 145 selfloop flow, removed 11 redundant places. [2024-11-09 07:07:03,396 INFO L231 Difference]: Finished difference. Result has 341 places, 1909 transitions, 25187 flow [2024-11-09 07:07:03,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=12159, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=25187, PETRI_PLACES=341, PETRI_TRANSITIONS=1909} [2024-11-09 07:07:03,398 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 237 predicate places. [2024-11-09 07:07:03,398 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 1909 transitions, 25187 flow [2024-11-09 07:07:03,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 50.90909090909091) internal successors, (1680), 33 states have internal predecessors, (1680), 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) [2024-11-09 07:07:03,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:07:03,400 INFO L204 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] [2024-11-09 07:07:03,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:07:03,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:07:03,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:07:03,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash -592430494, now seen corresponding path program 3 times [2024-11-09 07:07:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:07:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743273193] [2024-11-09 07:07:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:03,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:07:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:04,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:07:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743273193] [2024-11-09 07:07:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743273193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:07:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265990824] [2024-11-09 07:07:04,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:07:04,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:07:04,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:07:04,029 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:07:04,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:07:04,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:07:04,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:07:04,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:07:04,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:07:04,142 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 [2024-11-09 07:07:04,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:07:04,203 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 [2024-11-09 07:07:04,379 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 [2024-11-09 07:07:04,423 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 [2024-11-09 07:07:04,464 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 [2024-11-09 07:07:04,523 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 [2024-11-09 07:07:04,674 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 [2024-11-09 07:07:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:04,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:07:04,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)))) is different from false [2024-11-09 07:07:06,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) 0)))))) is different from false [2024-11-09 07:07:06,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)))))) is different from false [2024-11-09 07:07:06,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2024-11-09 07:07:06,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:06,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-09 07:07:06,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:06,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2024-11-09 07:07:06,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-09 07:07:06,777 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:07:06,777 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:07:06,783 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:07:06,784 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:07:06,788 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:07:06,788 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-09 07:07:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265990824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:07:06,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:07:06,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31 [2024-11-09 07:07:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271850218] [2024-11-09 07:07:06,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:07:06,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:07:06,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:07:06,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:07:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=638, Unknown=17, NotChecked=220, Total=992 [2024-11-09 07:07:06,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-11-09 07:07:06,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1909 transitions, 25187 flow. Second operand has 32 states, 32 states have (on average 50.90625) internal successors, (1629), 32 states have internal predecessors, (1629), 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) [2024-11-09 07:07:06,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:07:06,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-11-09 07:07:06,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:07:24,597 INFO L124 PetriNetUnfolderBase]: 21511/44437 cut-off events. [2024-11-09 07:07:24,597 INFO L125 PetriNetUnfolderBase]: For 606830/609029 co-relation queries the response was YES. [2024-11-09 07:07:25,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262511 conditions, 44437 events. 21511/44437 cut-off events. For 606830/609029 co-relation queries the response was YES. Maximal size of possible extension queue 1633. Compared 452609 event pairs, 1813 based on Foata normal form. 910/43034 useless extension candidates. Maximal degree in co-relation 261917. Up to 12116 conditions per place. [2024-11-09 07:07:25,484 INFO L140 encePairwiseOnDemand]: 73/104 looper letters, 1963 selfloop transitions, 1405 changer transitions 48/3482 dead transitions. [2024-11-09 07:07:25,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 3482 transitions, 54577 flow [2024-11-09 07:07:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-09 07:07:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2024-11-09 07:07:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3085 transitions. [2024-11-09 07:07:25,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.617988782051282 [2024-11-09 07:07:25,489 INFO L175 Difference]: Start difference. First operand has 341 places, 1909 transitions, 25187 flow. Second operand 48 states and 3085 transitions. [2024-11-09 07:07:25,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 3482 transitions, 54577 flow [2024-11-09 07:07:32,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 3482 transitions, 53701 flow, removed 342 selfloop flow, removed 25 redundant places. [2024-11-09 07:07:32,638 INFO L231 Difference]: Finished difference. Result has 384 places, 2600 transitions, 41051 flow [2024-11-09 07:07:32,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=24641, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=767, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1039, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=41051, PETRI_PLACES=384, PETRI_TRANSITIONS=2600} [2024-11-09 07:07:32,640 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 280 predicate places. [2024-11-09 07:07:32,640 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 2600 transitions, 41051 flow [2024-11-09 07:07:32,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 50.90625) internal successors, (1629), 32 states have internal predecessors, (1629), 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) [2024-11-09 07:07:32,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:07:32,641 INFO L204 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] [2024-11-09 07:07:32,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:07:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:07:32,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:07:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -741761498, now seen corresponding path program 4 times [2024-11-09 07:07:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:07:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983334745] [2024-11-09 07:07:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:07:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:33,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:07:33,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983334745] [2024-11-09 07:07:33,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983334745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:07:33,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447893582] [2024-11-09 07:07:33,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:07:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:07:33,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:07:33,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:07:33,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:07:33,351 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:07:33,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:07:33,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:07:33,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:07:33,454 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 [2024-11-09 07:07:33,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:07:33,548 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 [2024-11-09 07:07:33,761 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 [2024-11-09 07:07:33,858 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 [2024-11-09 07:07:33,905 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 [2024-11-09 07:07:33,961 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 [2024-11-09 07:07:34,038 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 [2024-11-09 07:07:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:34,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:07:34,099 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)))) is different from false [2024-11-09 07:07:34,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)))))) is different from false [2024-11-09 07:07:34,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)))))) is different from false [2024-11-09 07:07:34,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-11-09 07:07:34,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 0) .cse4 0) .cse2 0)))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-11-09 07:07:34,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:34,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-09 07:07:34,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:07:34,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2024-11-09 07:07:34,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-09 07:07:34,254 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:07:34,255 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:07:34,265 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:07:34,266 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:07:34,273 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:07:34,274 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-09 07:07:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447893582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:07:34,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:07:34,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 40 [2024-11-09 07:07:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072166466] [2024-11-09 07:07:34,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:07:34,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 07:07:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:07:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 07:07:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1133, Unknown=5, NotChecked=360, Total=1640 [2024-11-09 07:07:34,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 104 [2024-11-09 07:07:34,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 2600 transitions, 41051 flow. Second operand has 41 states, 41 states have (on average 37.24390243902439) internal successors, (1527), 41 states have internal predecessors, (1527), 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) [2024-11-09 07:07:34,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:07:34,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 104 [2024-11-09 07:07:34,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand