./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:05:04,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:05:05,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:05:05,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:05:05,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:05:05,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:05:05,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:05:05,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:05:05,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:05:05,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:05:05,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:05:05,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:05:05,062 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:05:05,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:05:05,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:05:05,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:05:05,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:05:05,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:05:05,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:05:05,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:05:05,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:05:05,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:05:05,067 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:05:05,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:05:05,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:05:05,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:05:05,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:05:05,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:05:05,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:05:05,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:05:05,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:05:05,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:05:05,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:05:05,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:05:05,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:05:05,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:05:05,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:05:05,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:05:05,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:05:05,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:05:05,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:05:05,072 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-clean/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-clean/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 -> 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 [2024-10-11 17:05:05,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:05:05,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:05:05,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:05:05,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:05:05,291 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:05:05,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2024-10-11 17:05:06,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:05:06,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:05:06,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2024-10-11 17:05:06,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7bbab1e7d/e722da9232404b4697cdb5abdd0d6e0f/FLAG485220a0e [2024-10-11 17:05:06,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7bbab1e7d/e722da9232404b4697cdb5abdd0d6e0f [2024-10-11 17:05:06,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:05:06,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:05:06,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:05:06,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:05:06,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:05:06,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:06" (1/1) ... [2024-10-11 17:05:06,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1794d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:06, skipping insertion in model container [2024-10-11 17:05:06,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:06" (1/1) ... [2024-10-11 17:05:06,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:05:07,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:05:07,078 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:05:07,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:05:07,159 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:05:07,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07 WrapperNode [2024-10-11 17:05:07,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:05:07,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:05:07,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:05:07,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:05:07,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,200 INFO L138 Inliner]: procedures = 170, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2024-10-11 17:05:07,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:05:07,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:05:07,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:05:07,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:05:07,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:05:07,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:05:07,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:05:07,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:05:07,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (1/1) ... [2024-10-11 17:05:07,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:05:07,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:05:07,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:05:07,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:05:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-10-11 17:05:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:05:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:05:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-10-11 17:05:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-10-11 17:05:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:05:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:05:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:05:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:05:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:05:07,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:05:07,298 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:05:07,453 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:05:07,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:05:07,626 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:05:07,627 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:05:07,641 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:05:07,641 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:05:07,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:07 BoogieIcfgContainer [2024-10-11 17:05:07,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:05:07,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:05:07,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:05:07,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:05:07,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:05:06" (1/3) ... [2024-10-11 17:05:07,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b26efc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:07, skipping insertion in model container [2024-10-11 17:05:07,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:07" (2/3) ... [2024-10-11 17:05:07,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b26efc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:07, skipping insertion in model container [2024-10-11 17:05:07,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:07" (3/3) ... [2024-10-11 17:05:07,649 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-array-2.i [2024-10-11 17:05:07,660 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:05:07,660 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 17:05:07,661 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:05:07,715 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:05:07,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 124 transitions, 255 flow [2024-10-11 17:05:07,785 INFO L124 PetriNetUnfolderBase]: 14/185 cut-off events. [2024-10-11 17:05:07,786 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:05:07,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 185 events. 14/185 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 465 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2024-10-11 17:05:07,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 124 transitions, 255 flow [2024-10-11 17:05:07,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 124 transitions, 255 flow [2024-10-11 17:05:07,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:05:07,811 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;@2bc5383c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:05:07,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 17:05:07,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:05:07,825 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-11 17:05:07,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:05:07,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:07,826 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] [2024-10-11 17:05:07,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:05:07,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 78207785, now seen corresponding path program 1 times [2024-10-11 17:05:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898871248] [2024-10-11 17:05:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898871248] [2024-10-11 17:05:08,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898871248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:08,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:08,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240274527] [2024-10-11 17:05:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:08,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:05:08,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:08,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:05:08,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:05:08,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 124 [2024-10-11 17:05:08,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 124 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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-10-11 17:05:08,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:08,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 124 [2024-10-11 17:05:08,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:08,449 INFO L124 PetriNetUnfolderBase]: 3/188 cut-off events. [2024-10-11 17:05:08,450 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2024-10-11 17:05:08,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 188 events. 3/188 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 308 event pairs, 0 based on Foata normal form. 9/178 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2024-10-11 17:05:08,453 INFO L140 encePairwiseOnDemand]: 106/124 looper letters, 16 selfloop transitions, 8 changer transitions 7/128 dead transitions. [2024-10-11 17:05:08,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 128 transitions, 323 flow [2024-10-11 17:05:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:05:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:05:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2024-10-11 17:05:08,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8891129032258065 [2024-10-11 17:05:08,469 INFO L175 Difference]: Start difference. First operand has 119 places, 124 transitions, 255 flow. Second operand 4 states and 441 transitions. [2024-10-11 17:05:08,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 128 transitions, 323 flow [2024-10-11 17:05:08,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 128 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:08,479 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 289 flow [2024-10-11 17:05:08,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2024-10-11 17:05:08,486 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 4 predicate places. [2024-10-11 17:05:08,486 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 289 flow [2024-10-11 17:05:08,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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-10-11 17:05:08,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:08,487 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] [2024-10-11 17:05:08,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:05:08,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:05:08,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1452247682, now seen corresponding path program 1 times [2024-10-11 17:05:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:08,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503008586] [2024-10-11 17:05:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503008586] [2024-10-11 17:05:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503008586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:08,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006359771] [2024-10-11 17:05:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:09,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 124 [2024-10-11 17:05:09,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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-10-11 17:05:09,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:09,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 124 [2024-10-11 17:05:09,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:09,142 INFO L124 PetriNetUnfolderBase]: 83/498 cut-off events. [2024-10-11 17:05:09,142 INFO L125 PetriNetUnfolderBase]: For 60/66 co-relation queries the response was YES. [2024-10-11 17:05:09,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 498 events. 83/498 cut-off events. For 60/66 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2488 event pairs, 44 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 640. Up to 191 conditions per place. [2024-10-11 17:05:09,147 INFO L140 encePairwiseOnDemand]: 113/124 looper letters, 35 selfloop transitions, 22 changer transitions 0/139 dead transitions. [2024-10-11 17:05:09,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 139 transitions, 445 flow [2024-10-11 17:05:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2024-10-11 17:05:09,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7446236559139785 [2024-10-11 17:05:09,152 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 289 flow. Second operand 6 states and 554 transitions. [2024-10-11 17:05:09,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 139 transitions, 445 flow [2024-10-11 17:05:09,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 139 transitions, 443 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:09,157 INFO L231 Difference]: Finished difference. Result has 132 places, 139 transitions, 437 flow [2024-10-11 17:05:09,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=132, PETRI_TRANSITIONS=139} [2024-10-11 17:05:09,158 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2024-10-11 17:05:09,158 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 139 transitions, 437 flow [2024-10-11 17:05:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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-10-11 17:05:09,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:09,159 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] [2024-10-11 17:05:09,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:05:09,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:05:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -373496246, now seen corresponding path program 1 times [2024-10-11 17:05:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60275905] [2024-10-11 17:05:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60275905] [2024-10-11 17:05:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60275905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536870296] [2024-10-11 17:05:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:09,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:09,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 124 [2024-10-11 17:05:09,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 139 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10-11 17:05:09,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:09,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 124 [2024-10-11 17:05:09,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:09,243 INFO L124 PetriNetUnfolderBase]: 33/304 cut-off events. [2024-10-11 17:05:09,244 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 17:05:09,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 304 events. 33/304 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1013 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 416. Up to 45 conditions per place. [2024-10-11 17:05:09,248 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 3 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-10-11 17:05:09,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 138 transitions, 445 flow [2024-10-11 17:05:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2024-10-11 17:05:09,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112903225806451 [2024-10-11 17:05:09,250 INFO L175 Difference]: Start difference. First operand has 132 places, 139 transitions, 437 flow. Second operand 3 states and 339 transitions. [2024-10-11 17:05:09,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 138 transitions, 445 flow [2024-10-11 17:05:09,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 138 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:09,255 INFO L231 Difference]: Finished difference. Result has 133 places, 138 transitions, 439 flow [2024-10-11 17:05:09,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=133, PETRI_TRANSITIONS=138} [2024-10-11 17:05:09,256 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 14 predicate places. [2024-10-11 17:05:09,257 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 138 transitions, 439 flow [2024-10-11 17:05:09,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10-11 17:05:09,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:09,258 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-10-11 17:05:09,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:05:09,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:05:09,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1750422863, now seen corresponding path program 1 times [2024-10-11 17:05:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:09,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165255870] [2024-10-11 17:05:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:09,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:09,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165255870] [2024-10-11 17:05:09,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165255870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:09,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:09,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271846252] [2024-10-11 17:05:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:09,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:09,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2024-10-11 17:05:09,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 138 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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-10-11 17:05:09,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:09,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2024-10-11 17:05:09,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:09,747 INFO L124 PetriNetUnfolderBase]: 131/543 cut-off events. [2024-10-11 17:05:09,747 INFO L125 PetriNetUnfolderBase]: For 144/159 co-relation queries the response was YES. [2024-10-11 17:05:09,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 543 events. 131/543 cut-off events. For 144/159 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2602 event pairs, 23 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1089. Up to 247 conditions per place. [2024-10-11 17:05:09,750 INFO L140 encePairwiseOnDemand]: 109/124 looper letters, 38 selfloop transitions, 48 changer transitions 0/181 dead transitions. [2024-10-11 17:05:09,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 181 transitions, 767 flow [2024-10-11 17:05:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2024-10-11 17:05:09,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-10-11 17:05:09,751 INFO L175 Difference]: Start difference. First operand has 133 places, 138 transitions, 439 flow. Second operand 6 states and 620 transitions. [2024-10-11 17:05:09,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 181 transitions, 767 flow [2024-10-11 17:05:09,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 181 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:09,756 INFO L231 Difference]: Finished difference. Result has 141 places, 181 transitions, 823 flow [2024-10-11 17:05:09,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=141, PETRI_TRANSITIONS=181} [2024-10-11 17:05:09,757 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2024-10-11 17:05:09,757 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 181 transitions, 823 flow [2024-10-11 17:05:09,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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-10-11 17:05:09,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:09,758 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] [2024-10-11 17:05:09,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:05:09,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:05:09,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1025985615, now seen corresponding path program 1 times [2024-10-11 17:05:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327001125] [2024-10-11 17:05:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:05:09,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:09,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327001125] [2024-10-11 17:05:09,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327001125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:09,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:09,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346687614] [2024-10-11 17:05:09,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:09,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:10,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 124 [2024-10-11 17:05:10,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 181 transitions, 823 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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-10-11 17:05:10,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:10,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 124 [2024-10-11 17:05:10,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:10,262 INFO L124 PetriNetUnfolderBase]: 159/710 cut-off events. [2024-10-11 17:05:10,265 INFO L125 PetriNetUnfolderBase]: For 588/658 co-relation queries the response was YES. [2024-10-11 17:05:10,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 710 events. 159/710 cut-off events. For 588/658 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4081 event pairs, 26 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 1774. Up to 300 conditions per place. [2024-10-11 17:05:10,269 INFO L140 encePairwiseOnDemand]: 113/124 looper letters, 87 selfloop transitions, 32 changer transitions 0/209 dead transitions. [2024-10-11 17:05:10,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 209 transitions, 1232 flow [2024-10-11 17:05:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2024-10-11 17:05:10,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7862903225806451 [2024-10-11 17:05:10,271 INFO L175 Difference]: Start difference. First operand has 141 places, 181 transitions, 823 flow. Second operand 6 states and 585 transitions. [2024-10-11 17:05:10,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 209 transitions, 1232 flow [2024-10-11 17:05:10,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 209 transitions, 1214 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:10,284 INFO L231 Difference]: Finished difference. Result has 151 places, 208 transitions, 1131 flow [2024-10-11 17:05:10,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1131, PETRI_PLACES=151, PETRI_TRANSITIONS=208} [2024-10-11 17:05:10,285 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2024-10-11 17:05:10,285 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 208 transitions, 1131 flow [2024-10-11 17:05:10,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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-10-11 17:05:10,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:10,287 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] [2024-10-11 17:05:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:05:10,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:05:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 710606559, now seen corresponding path program 1 times [2024-10-11 17:05:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:10,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287694217] [2024-10-11 17:05:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287694217] [2024-10-11 17:05:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287694217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:10,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:10,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:10,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102247384] [2024-10-11 17:05:10,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:10,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:10,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:10,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:10,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 124 [2024-10-11 17:05:10,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 208 transitions, 1131 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-10-11 17:05:10,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:10,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 124 [2024-10-11 17:05:10,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:10,390 INFO L124 PetriNetUnfolderBase]: 134/582 cut-off events. [2024-10-11 17:05:10,390 INFO L125 PetriNetUnfolderBase]: For 469/486 co-relation queries the response was YES. [2024-10-11 17:05:10,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 582 events. 134/582 cut-off events. For 469/486 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3012 event pairs, 6 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 1555. Up to 129 conditions per place. [2024-10-11 17:05:10,393 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 5 selfloop transitions, 2 changer transitions 19/207 dead transitions. [2024-10-11 17:05:10,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 207 transitions, 1143 flow [2024-10-11 17:05:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2024-10-11 17:05:10,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9005376344086021 [2024-10-11 17:05:10,395 INFO L175 Difference]: Start difference. First operand has 151 places, 208 transitions, 1131 flow. Second operand 3 states and 335 transitions. [2024-10-11 17:05:10,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 207 transitions, 1143 flow [2024-10-11 17:05:10,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 207 transitions, 1087 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:10,402 INFO L231 Difference]: Finished difference. Result has 152 places, 188 transitions, 1027 flow [2024-10-11 17:05:10,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=152, PETRI_TRANSITIONS=188} [2024-10-11 17:05:10,403 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2024-10-11 17:05:10,403 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 188 transitions, 1027 flow [2024-10-11 17:05:10,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-10-11 17:05:10,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:10,404 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:10,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:05:10,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-11 17:05:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1788576964, now seen corresponding path program 1 times [2024-10-11 17:05:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:10,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57378357] [2024-10-11 17:05:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:10,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:05:10,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:05:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:05:10,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:05:10,455 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:05:10,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-10-11 17:05:10,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-10-11 17:05:10,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-10-11 17:05:10,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-10-11 17:05:10,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-10-11 17:05:10,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-10-11 17:05:10,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-10-11 17:05:10,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-10-11 17:05:10,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-10-11 17:05:10,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-10-11 17:05:10,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:05:10,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:10,464 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:05:10,464 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:05:10,487 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:05:10,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 147 transitions, 310 flow [2024-10-11 17:05:10,513 INFO L124 PetriNetUnfolderBase]: 27/332 cut-off events. [2024-10-11 17:05:10,514 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-10-11 17:05:10,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 332 events. 27/332 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 952 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 187. Up to 8 conditions per place. [2024-10-11 17:05:10,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 147 transitions, 310 flow [2024-10-11 17:05:10,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 147 transitions, 310 flow [2024-10-11 17:05:10,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:05:10,519 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;@2bc5383c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:05:10,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 17:05:10,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:05:10,521 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-11 17:05:10,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:05:10,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:10,522 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] [2024-10-11 17:05:10,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash -453423639, now seen corresponding path program 1 times [2024-10-11 17:05:10,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119183843] [2024-10-11 17:05:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:10,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:10,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119183843] [2024-10-11 17:05:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119183843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:10,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:10,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953975311] [2024-10-11 17:05:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:10,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:05:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:05:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:05:10,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 147 [2024-10-11 17:05:10,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 147 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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-10-11 17:05:10,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:10,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 147 [2024-10-11 17:05:10,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:10,721 INFO L124 PetriNetUnfolderBase]: 10/392 cut-off events. [2024-10-11 17:05:10,722 INFO L125 PetriNetUnfolderBase]: For 20/38 co-relation queries the response was YES. [2024-10-11 17:05:10,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 392 events. 10/392 cut-off events. For 20/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1275 event pairs, 0 based on Foata normal form. 19/369 useless extension candidates. Maximal degree in co-relation 223. Up to 42 conditions per place. [2024-10-11 17:05:10,723 INFO L140 encePairwiseOnDemand]: 129/147 looper letters, 24 selfloop transitions, 9 changer transitions 4/155 dead transitions. [2024-10-11 17:05:10,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 155 transitions, 404 flow [2024-10-11 17:05:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:05:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:05:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2024-10-11 17:05:10,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9030612244897959 [2024-10-11 17:05:10,725 INFO L175 Difference]: Start difference. First operand has 143 places, 147 transitions, 310 flow. Second operand 4 states and 531 transitions. [2024-10-11 17:05:10,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 155 transitions, 404 flow [2024-10-11 17:05:10,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 155 transitions, 404 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:10,727 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 362 flow [2024-10-11 17:05:10,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2024-10-11 17:05:10,728 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 4 predicate places. [2024-10-11 17:05:10,728 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 362 flow [2024-10-11 17:05:10,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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-10-11 17:05:10,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:10,729 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] [2024-10-11 17:05:10,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:05:10,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:10,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash -752952495, now seen corresponding path program 1 times [2024-10-11 17:05:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865055496] [2024-10-11 17:05:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:10,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-10-11 17:05:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865055496] [2024-10-11 17:05:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865055496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904027088] [2024-10-11 17:05:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:11,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 147 [2024-10-11 17:05:11,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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-10-11 17:05:11,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:11,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 147 [2024-10-11 17:05:11,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:11,445 INFO L124 PetriNetUnfolderBase]: 1178/4231 cut-off events. [2024-10-11 17:05:11,445 INFO L125 PetriNetUnfolderBase]: For 444/466 co-relation queries the response was YES. [2024-10-11 17:05:11,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 4231 events. 1178/4231 cut-off events. For 444/466 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 36472 event pairs, 769 based on Foata normal form. 0/3818 useless extension candidates. Maximal degree in co-relation 4257. Up to 1921 conditions per place. [2024-10-11 17:05:11,464 INFO L140 encePairwiseOnDemand]: 132/147 looper letters, 45 selfloop transitions, 38 changer transitions 0/183 dead transitions. [2024-10-11 17:05:11,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 183 transitions, 609 flow [2024-10-11 17:05:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2024-10-11 17:05:11,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7698412698412699 [2024-10-11 17:05:11,467 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 362 flow. Second operand 6 states and 679 transitions. [2024-10-11 17:05:11,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 183 transitions, 609 flow [2024-10-11 17:05:11,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 183 transitions, 607 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:11,471 INFO L231 Difference]: Finished difference. Result has 156 places, 182 transitions, 614 flow [2024-10-11 17:05:11,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=156, PETRI_TRANSITIONS=182} [2024-10-11 17:05:11,471 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2024-10-11 17:05:11,472 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 182 transitions, 614 flow [2024-10-11 17:05:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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-10-11 17:05:11,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:11,472 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] [2024-10-11 17:05:11,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:05:11,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 664605853, now seen corresponding path program 1 times [2024-10-11 17:05:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920813215] [2024-10-11 17:05:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:11,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920813215] [2024-10-11 17:05:11,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920813215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:11,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:11,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652256830] [2024-10-11 17:05:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:11,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:11,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:11,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 147 [2024-10-11 17:05:11,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 182 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-10-11 17:05:11,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:11,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 147 [2024-10-11 17:05:11,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:11,797 INFO L124 PetriNetUnfolderBase]: 638/3399 cut-off events. [2024-10-11 17:05:11,798 INFO L125 PetriNetUnfolderBase]: For 508/520 co-relation queries the response was YES. [2024-10-11 17:05:11,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5625 conditions, 3399 events. 638/3399 cut-off events. For 508/520 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 30040 event pairs, 123 based on Foata normal form. 0/3081 useless extension candidates. Maximal degree in co-relation 4695. Up to 719 conditions per place. [2024-10-11 17:05:11,820 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 15 selfloop transitions, 6 changer transitions 0/191 dead transitions. [2024-10-11 17:05:11,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 191 transitions, 685 flow [2024-10-11 17:05:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2024-10-11 17:05:11,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9229024943310657 [2024-10-11 17:05:11,822 INFO L175 Difference]: Start difference. First operand has 156 places, 182 transitions, 614 flow. Second operand 3 states and 407 transitions. [2024-10-11 17:05:11,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 191 transitions, 685 flow [2024-10-11 17:05:11,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 191 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:11,828 INFO L231 Difference]: Finished difference. Result has 160 places, 188 transitions, 666 flow [2024-10-11 17:05:11,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=160, PETRI_TRANSITIONS=188} [2024-10-11 17:05:11,829 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 17 predicate places. [2024-10-11 17:05:11,829 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 188 transitions, 666 flow [2024-10-11 17:05:11,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-10-11 17:05:11,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:11,830 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-10-11 17:05:11,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:05:11,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:11,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 795890850, now seen corresponding path program 1 times [2024-10-11 17:05:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:11,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347533262] [2024-10-11 17:05:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:12,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:12,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347533262] [2024-10-11 17:05:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347533262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828357073] [2024-10-11 17:05:12,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:12,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:12,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:12,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:12,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 147 [2024-10-11 17:05:12,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 188 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-10-11 17:05:12,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:12,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 147 [2024-10-11 17:05:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:13,465 INFO L124 PetriNetUnfolderBase]: 3405/12407 cut-off events. [2024-10-11 17:05:13,465 INFO L125 PetriNetUnfolderBase]: For 2904/3027 co-relation queries the response was YES. [2024-10-11 17:05:13,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24726 conditions, 12407 events. 3405/12407 cut-off events. For 2904/3027 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 130447 event pairs, 801 based on Foata normal form. 1/11234 useless extension candidates. Maximal degree in co-relation 21029. Up to 4282 conditions per place. [2024-10-11 17:05:13,569 INFO L140 encePairwiseOnDemand]: 124/147 looper letters, 95 selfloop transitions, 96 changer transitions 0/314 dead transitions. [2024-10-11 17:05:13,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 314 transitions, 1564 flow [2024-10-11 17:05:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2024-10-11 17:05:13,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8843537414965986 [2024-10-11 17:05:13,571 INFO L175 Difference]: Start difference. First operand has 160 places, 188 transitions, 666 flow. Second operand 6 states and 780 transitions. [2024-10-11 17:05:13,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 314 transitions, 1564 flow [2024-10-11 17:05:13,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 314 transitions, 1552 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:13,585 INFO L231 Difference]: Finished difference. Result has 167 places, 282 transitions, 1450 flow [2024-10-11 17:05:13,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1450, PETRI_PLACES=167, PETRI_TRANSITIONS=282} [2024-10-11 17:05:13,586 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 24 predicate places. [2024-10-11 17:05:13,586 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 282 transitions, 1450 flow [2024-10-11 17:05:13,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-10-11 17:05:13,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:13,587 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] [2024-10-11 17:05:13,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:05:13,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:13,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1899942509, now seen corresponding path program 1 times [2024-10-11 17:05:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:13,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148670457] [2024-10-11 17:05:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:05:13,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148670457] [2024-10-11 17:05:13,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148670457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:13,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761604774] [2024-10-11 17:05:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:13,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:13,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:13,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:13,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 147 [2024-10-11 17:05:13,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 282 transitions, 1450 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 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-10-11 17:05:13,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:13,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 147 [2024-10-11 17:05:13,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:15,568 INFO L124 PetriNetUnfolderBase]: 4624/17029 cut-off events. [2024-10-11 17:05:15,568 INFO L125 PetriNetUnfolderBase]: For 11614/12397 co-relation queries the response was YES. [2024-10-11 17:05:15,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42348 conditions, 17029 events. 4624/17029 cut-off events. For 11614/12397 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 194384 event pairs, 999 based on Foata normal form. 62/15434 useless extension candidates. Maximal degree in co-relation 36384. Up to 6479 conditions per place. [2024-10-11 17:05:15,668 INFO L140 encePairwiseOnDemand]: 132/147 looper letters, 147 selfloop transitions, 72 changer transitions 0/351 dead transitions. [2024-10-11 17:05:15,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 351 transitions, 2340 flow [2024-10-11 17:05:15,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2024-10-11 17:05:15,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8049886621315193 [2024-10-11 17:05:15,671 INFO L175 Difference]: Start difference. First operand has 167 places, 282 transitions, 1450 flow. Second operand 6 states and 710 transitions. [2024-10-11 17:05:15,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 351 transitions, 2340 flow [2024-10-11 17:05:15,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 351 transitions, 2322 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:15,729 INFO L231 Difference]: Finished difference. Result has 177 places, 349 transitions, 2226 flow [2024-10-11 17:05:15,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2226, PETRI_PLACES=177, PETRI_TRANSITIONS=349} [2024-10-11 17:05:15,731 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 34 predicate places. [2024-10-11 17:05:15,731 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 349 transitions, 2226 flow [2024-10-11 17:05:15,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 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-10-11 17:05:15,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:15,732 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] [2024-10-11 17:05:15,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:05:15,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:15,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2121789972, now seen corresponding path program 1 times [2024-10-11 17:05:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111208028] [2024-10-11 17:05:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111208028] [2024-10-11 17:05:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111208028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:15,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271937754] [2024-10-11 17:05:15,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:15,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:15,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 147 [2024-10-11 17:05:15,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 349 transitions, 2226 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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-10-11 17:05:15,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:15,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 147 [2024-10-11 17:05:15,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:17,379 INFO L124 PetriNetUnfolderBase]: 3749/14887 cut-off events. [2024-10-11 17:05:17,379 INFO L125 PetriNetUnfolderBase]: For 10969/11404 co-relation queries the response was YES. [2024-10-11 17:05:17,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36457 conditions, 14887 events. 3749/14887 cut-off events. For 10969/11404 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 169927 event pairs, 339 based on Foata normal form. 35/13755 useless extension candidates. Maximal degree in co-relation 31560. Up to 3118 conditions per place. [2024-10-11 17:05:17,484 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 16 selfloop transitions, 7 changer transitions 0/356 dead transitions. [2024-10-11 17:05:17,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 356 transitions, 2300 flow [2024-10-11 17:05:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2024-10-11 17:05:17,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9138321995464853 [2024-10-11 17:05:17,489 INFO L175 Difference]: Start difference. First operand has 177 places, 349 transitions, 2226 flow. Second operand 3 states and 403 transitions. [2024-10-11 17:05:17,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 356 transitions, 2300 flow [2024-10-11 17:05:17,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 356 transitions, 2160 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:17,557 INFO L231 Difference]: Finished difference. Result has 181 places, 354 transitions, 2142 flow [2024-10-11 17:05:17,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2142, PETRI_PLACES=181, PETRI_TRANSITIONS=354} [2024-10-11 17:05:17,558 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 38 predicate places. [2024-10-11 17:05:17,558 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 354 transitions, 2142 flow [2024-10-11 17:05:17,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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-10-11 17:05:17,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:17,559 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, 1, 1, 1, 1] [2024-10-11 17:05:17,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:05:17,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:17,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash 302506968, now seen corresponding path program 1 times [2024-10-11 17:05:17,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:17,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792484321] [2024-10-11 17:05:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:17,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:05:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792484321] [2024-10-11 17:05:17,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792484321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:17,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:17,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:05:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340860082] [2024-10-11 17:05:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:17,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:05:17,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:17,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:05:17,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:05:18,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 147 [2024-10-11 17:05:18,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 354 transitions, 2142 flow. Second operand has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 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-10-11 17:05:18,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:18,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 147 [2024-10-11 17:05:18,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:20,950 INFO L124 PetriNetUnfolderBase]: 7015/22231 cut-off events. [2024-10-11 17:05:20,950 INFO L125 PetriNetUnfolderBase]: For 23492/24226 co-relation queries the response was YES. [2024-10-11 17:05:21,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66300 conditions, 22231 events. 7015/22231 cut-off events. For 23492/24226 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 255794 event pairs, 850 based on Foata normal form. 341/21143 useless extension candidates. Maximal degree in co-relation 59968. Up to 5002 conditions per place. [2024-10-11 17:05:21,100 INFO L140 encePairwiseOnDemand]: 128/147 looper letters, 327 selfloop transitions, 238 changer transitions 0/689 dead transitions. [2024-10-11 17:05:21,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 689 transitions, 5690 flow [2024-10-11 17:05:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:05:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:05:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1195 transitions. [2024-10-11 17:05:21,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8129251700680272 [2024-10-11 17:05:21,104 INFO L175 Difference]: Start difference. First operand has 181 places, 354 transitions, 2142 flow. Second operand 10 states and 1195 transitions. [2024-10-11 17:05:21,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 689 transitions, 5690 flow [2024-10-11 17:05:21,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 689 transitions, 5676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:21,230 INFO L231 Difference]: Finished difference. Result has 195 places, 527 transitions, 4579 flow [2024-10-11 17:05:21,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4579, PETRI_PLACES=195, PETRI_TRANSITIONS=527} [2024-10-11 17:05:21,231 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 52 predicate places. [2024-10-11 17:05:21,232 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 527 transitions, 4579 flow [2024-10-11 17:05:21,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 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-10-11 17:05:21,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:21,232 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, 1, 1, 1, 1] [2024-10-11 17:05:21,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:05:21,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:21,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2098975069, now seen corresponding path program 1 times [2024-10-11 17:05:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:21,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030789408] [2024-10-11 17:05:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:05:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:21,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030789408] [2024-10-11 17:05:21,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030789408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:21,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:21,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:05:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662711257] [2024-10-11 17:05:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:21,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:05:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:21,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:05:21,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:05:22,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 147 [2024-10-11 17:05:22,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 527 transitions, 4579 flow. Second operand has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-11 17:05:22,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:22,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 147 [2024-10-11 17:05:22,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:25,166 INFO L124 PetriNetUnfolderBase]: 6458/21982 cut-off events. [2024-10-11 17:05:25,166 INFO L125 PetriNetUnfolderBase]: For 48170/49566 co-relation queries the response was YES. [2024-10-11 17:05:25,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75861 conditions, 21982 events. 6458/21982 cut-off events. For 48170/49566 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 258300 event pairs, 948 based on Foata normal form. 354/20551 useless extension candidates. Maximal degree in co-relation 71376. Up to 5184 conditions per place. [2024-10-11 17:05:25,366 INFO L140 encePairwiseOnDemand]: 137/147 looper letters, 476 selfloop transitions, 38 changer transitions 0/672 dead transitions. [2024-10-11 17:05:25,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 672 transitions, 7415 flow [2024-10-11 17:05:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:05:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:05:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1004 transitions. [2024-10-11 17:05:25,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7588813303099018 [2024-10-11 17:05:25,370 INFO L175 Difference]: Start difference. First operand has 195 places, 527 transitions, 4579 flow. Second operand 9 states and 1004 transitions. [2024-10-11 17:05:25,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 672 transitions, 7415 flow [2024-10-11 17:05:25,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 672 transitions, 7378 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:25,625 INFO L231 Difference]: Finished difference. Result has 200 places, 526 transitions, 4622 flow [2024-10-11 17:05:25,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=4546, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4622, PETRI_PLACES=200, PETRI_TRANSITIONS=526} [2024-10-11 17:05:25,626 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 57 predicate places. [2024-10-11 17:05:25,626 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 526 transitions, 4622 flow [2024-10-11 17:05:25,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-11 17:05:25,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:25,627 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:25,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:05:25,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:25,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash -154643913, now seen corresponding path program 1 times [2024-10-11 17:05:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132941337] [2024-10-11 17:05:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:05:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132941337] [2024-10-11 17:05:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132941337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:05:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617157608] [2024-10-11 17:05:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:25,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:05:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:05:25,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:05:25,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:05:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:26,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 17:05:26,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:05:26,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:05:26,163 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-10-11 17:05:26,370 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 15 treesize of output 11 [2024-10-11 17:05:26,433 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 28 treesize of output 27 [2024-10-11 17:05:26,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:05:26,476 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 40 treesize of output 42 [2024-10-11 17:05:26,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:05:26,529 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 52 treesize of output 57 [2024-10-11 17:05:26,568 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 56 treesize of output 45 [2024-10-11 17:05:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:05:26,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:05:26,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_377 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t~1#1.offset|)))) (forall ((v_ArrVal_377 (Array Int Int))) (= (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_377 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)))) (forall ((v_ArrVal_377 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t~1#1.offset|)))))) is different from false [2024-10-11 17:05:26,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t~1#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet7#1|)))) (and (forall ((v_ArrVal_377 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)))) (forall ((v_ArrVal_377 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)))) (forall ((v_ArrVal_377 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2))) (forall ((v_ArrVal_377 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset|)))))))) is different from false [2024-10-11 17:05:30,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:05:30,805 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-10-11 17:05:30,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:05:30,817 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 113 treesize of output 34 [2024-10-11 17:05:30,828 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:05:30,828 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-10-11 17:05:30,835 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:05:30,836 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-10-11 17:05:30,843 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:05:30,843 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-10-11 17:05:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-10-11 17:05:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617157608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:05:30,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:05:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 17:05:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446527933] [2024-10-11 17:05:30,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:05:30,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:05:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:05:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=270, Unknown=20, NotChecked=74, Total=462 [2024-10-11 17:05:31,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 147 [2024-10-11 17:05:31,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 526 transitions, 4622 flow. Second operand has 22 states, 22 states have (on average 73.9090909090909) internal successors, (1626), 22 states have internal predecessors, (1626), 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-10-11 17:05:31,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:31,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 147 [2024-10-11 17:05:31,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:36,950 INFO L124 PetriNetUnfolderBase]: 16228/41995 cut-off events. [2024-10-11 17:05:36,950 INFO L125 PetriNetUnfolderBase]: For 103509/103683 co-relation queries the response was YES. [2024-10-11 17:05:37,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145982 conditions, 41995 events. 16228/41995 cut-off events. For 103509/103683 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 483236 event pairs, 6182 based on Foata normal form. 366/38915 useless extension candidates. Maximal degree in co-relation 132449. Up to 19029 conditions per place. [2024-10-11 17:05:37,641 INFO L140 encePairwiseOnDemand]: 137/147 looper letters, 603 selfloop transitions, 36 changer transitions 0/733 dead transitions. [2024-10-11 17:05:37,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 733 transitions, 8102 flow [2024-10-11 17:05:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:05:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:05:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 777 transitions. [2024-10-11 17:05:37,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-10-11 17:05:37,644 INFO L175 Difference]: Start difference. First operand has 200 places, 526 transitions, 4622 flow. Second operand 9 states and 777 transitions. [2024-10-11 17:05:37,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 733 transitions, 8102 flow [2024-10-11 17:05:38,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 733 transitions, 8026 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 17:05:38,227 INFO L231 Difference]: Finished difference. Result has 199 places, 525 transitions, 4614 flow [2024-10-11 17:05:38,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=4542, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4614, PETRI_PLACES=199, PETRI_TRANSITIONS=525} [2024-10-11 17:05:38,228 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 56 predicate places. [2024-10-11 17:05:38,228 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 525 transitions, 4614 flow [2024-10-11 17:05:38,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 73.9090909090909) internal successors, (1626), 22 states have internal predecessors, (1626), 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-10-11 17:05:38,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:38,229 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:38,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:05:38,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 17:05:38,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:38,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -377109240, now seen corresponding path program 1 times [2024-10-11 17:05:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050122472] [2024-10-11 17:05:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:05:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050122472] [2024-10-11 17:05:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050122472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003034212] [2024-10-11 17:05:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:38,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:38,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:38,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:38,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:38,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 147 [2024-10-11 17:05:38,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 525 transitions, 4614 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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-10-11 17:05:38,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:38,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 147 [2024-10-11 17:05:38,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:42,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] thrEXIT-->L706-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][205], [Black: 193#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 170#true, 154#true, 32#L695true, 639#true, 628#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), 185#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 146#true, Black: 150#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 211#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 199#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 213#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 215#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 209#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 156#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 159#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 158#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 165#true, 148#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 172#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), Black: 175#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 173#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 174#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 141#true, 28#L706-7true, Black: 182#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 183#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 144#true, Black: 180#true, Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))]) [2024-10-11 17:05:42,249 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is not cut-off event [2024-10-11 17:05:42,249 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2024-10-11 17:05:42,249 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2024-10-11 17:05:42,249 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2024-10-11 17:05:43,100 INFO L124 PetriNetUnfolderBase]: 11959/32884 cut-off events. [2024-10-11 17:05:43,101 INFO L125 PetriNetUnfolderBase]: For 85078/86271 co-relation queries the response was YES. [2024-10-11 17:05:43,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119843 conditions, 32884 events. 11959/32884 cut-off events. For 85078/86271 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 373963 event pairs, 1365 based on Foata normal form. 26/30782 useless extension candidates. Maximal degree in co-relation 113532. Up to 14359 conditions per place. [2024-10-11 17:05:43,393 INFO L140 encePairwiseOnDemand]: 124/147 looper letters, 367 selfloop transitions, 354 changer transitions 0/882 dead transitions. [2024-10-11 17:05:43,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 882 transitions, 9330 flow [2024-10-11 17:05:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2024-10-11 17:05:43,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8798185941043084 [2024-10-11 17:05:43,395 INFO L175 Difference]: Start difference. First operand has 199 places, 525 transitions, 4614 flow. Second operand 6 states and 776 transitions. [2024-10-11 17:05:43,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 882 transitions, 9330 flow [2024-10-11 17:05:43,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 882 transitions, 9110 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 17:05:43,772 INFO L231 Difference]: Finished difference. Result has 200 places, 813 transitions, 8435 flow [2024-10-11 17:05:43,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=4542, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8435, PETRI_PLACES=200, PETRI_TRANSITIONS=813} [2024-10-11 17:05:43,772 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 57 predicate places. [2024-10-11 17:05:43,773 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 813 transitions, 8435 flow [2024-10-11 17:05:43,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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-10-11 17:05:43,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:43,773 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 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-10-11 17:05:43,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:05:43,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:43,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1792735591, now seen corresponding path program 1 times [2024-10-11 17:05:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405346761] [2024-10-11 17:05:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:05:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405346761] [2024-10-11 17:05:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405346761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:43,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913033521] [2024-10-11 17:05:43,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:43,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:43,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 147 [2024-10-11 17:05:43,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 813 transitions, 8435 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 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-10-11 17:05:43,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:43,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 147 [2024-10-11 17:05:43,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:47,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] thrEXIT-->L706-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][209], [Black: 193#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 154#true, 170#true, Black: 644#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 642#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 641#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), 639#true, Black: 643#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), 185#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 146#true, Black: 150#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 211#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 199#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 213#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 215#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 209#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 649#true, Black: 156#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 159#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 158#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 165#true, 148#(= |ULTIMATE.start_main_~i~0#1| 0), 52#L695-2true, Black: 172#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), Black: 175#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 173#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 174#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 141#true, 28#L706-7true, Black: 182#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 183#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 144#true, Black: 180#true, Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))]) [2024-10-11 17:05:47,279 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-10-11 17:05:47,279 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-10-11 17:05:47,279 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-10-11 17:05:47,279 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-10-11 17:05:47,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] thrEXIT-->L706-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][789], [Black: 193#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 154#true, 170#true, Black: 644#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 642#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 641#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), 639#true, Black: 643#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), 185#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 146#true, Black: 150#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 211#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 199#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 213#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 215#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 209#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 156#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 159#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 158#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 651#(= |thrThread2of2ForFork0_#t~nondet4| |#race~x~0|), Black: 167#(= |#race~x~0| 0), 148#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 172#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), Black: 175#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 173#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 174#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 141#true, 28#L706-7true, 13#L695-4true, 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 182#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 183#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 144#true, Black: 180#true, Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))]) [2024-10-11 17:05:47,315 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,315 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,315 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,315 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,359 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([480] thrEXIT-->L706-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][789], [Black: 193#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 170#true, 154#true, Black: 644#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 642#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 641#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), 639#true, Black: 643#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), 185#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 146#true, Black: 150#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 211#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 199#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 213#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 215#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 209#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 156#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 159#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 158#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 651#(= |thrThread2of2ForFork0_#t~nondet4| |#race~x~0|), Black: 167#(= |#race~x~0| 0), 148#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 172#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), Black: 175#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 173#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 174#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 141#true, 28#L706-7true, Black: 182#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), 13#L695-4true, Black: 183#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 144#true, Black: 180#true, Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))]) [2024-10-11 17:05:47,359 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,359 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,359 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,359 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-11 17:05:47,359 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-11 17:05:48,102 INFO L124 PetriNetUnfolderBase]: 10393/30750 cut-off events. [2024-10-11 17:05:48,103 INFO L125 PetriNetUnfolderBase]: For 85990/87484 co-relation queries the response was YES. [2024-10-11 17:05:48,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115333 conditions, 30750 events. 10393/30750 cut-off events. For 85990/87484 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 362500 event pairs, 729 based on Foata normal form. 75/29863 useless extension candidates. Maximal degree in co-relation 109474. Up to 7289 conditions per place. [2024-10-11 17:05:48,414 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 16 selfloop transitions, 9 changer transitions 0/819 dead transitions. [2024-10-11 17:05:48,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 819 transitions, 8510 flow [2024-10-11 17:05:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2024-10-11 17:05:48,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9115646258503401 [2024-10-11 17:05:48,415 INFO L175 Difference]: Start difference. First operand has 200 places, 813 transitions, 8435 flow. Second operand 3 states and 402 transitions. [2024-10-11 17:05:48,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 819 transitions, 8510 flow [2024-10-11 17:05:49,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 819 transitions, 8426 flow, removed 42 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:49,395 INFO L231 Difference]: Finished difference. Result has 204 places, 818 transitions, 8419 flow [2024-10-11 17:05:49,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=8351, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8419, PETRI_PLACES=204, PETRI_TRANSITIONS=818} [2024-10-11 17:05:49,395 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 61 predicate places. [2024-10-11 17:05:49,396 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 818 transitions, 8419 flow [2024-10-11 17:05:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 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-10-11 17:05:49,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:49,396 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:05:49,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:05:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2082772118, now seen corresponding path program 1 times [2024-10-11 17:05:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118034725] [2024-10-11 17:05:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:05:49,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:05:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:05:49,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:05:49,443 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:05:49,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-10-11 17:05:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-10-11 17:05:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-10-11 17:05:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-10-11 17:05:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-10-11 17:05:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-10-11 17:05:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-10-11 17:05:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-10-11 17:05:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-10-11 17:05:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-10-11 17:05:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-10-11 17:05:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-10-11 17:05:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-10-11 17:05:49,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:05:49,446 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:49,447 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:05:49,447 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:05:49,471 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:05:49,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 170 transitions, 367 flow [2024-10-11 17:05:49,525 INFO L124 PetriNetUnfolderBase]: 53/586 cut-off events. [2024-10-11 17:05:49,526 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2024-10-11 17:05:49,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 586 events. 53/586 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1999 event pairs, 1 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 340. Up to 16 conditions per place. [2024-10-11 17:05:49,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 170 transitions, 367 flow [2024-10-11 17:05:49,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 170 transitions, 367 flow [2024-10-11 17:05:49,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:05:49,535 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;@2bc5383c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:05:49,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 17:05:49,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:05:49,542 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-11 17:05:49,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:05:49,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:49,542 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] [2024-10-11 17:05:49,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:05:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1415249001, now seen corresponding path program 1 times [2024-10-11 17:05:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649168191] [2024-10-11 17:05:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649168191] [2024-10-11 17:05:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649168191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802749051] [2024-10-11 17:05:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:49,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:05:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:05:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:05:49,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 170 [2024-10-11 17:05:49,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 170 transitions, 367 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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-10-11 17:05:49,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:49,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 170 [2024-10-11 17:05:49,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:49,817 INFO L124 PetriNetUnfolderBase]: 25/749 cut-off events. [2024-10-11 17:05:49,817 INFO L125 PetriNetUnfolderBase]: For 76/122 co-relation queries the response was YES. [2024-10-11 17:05:49,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 749 events. 25/749 cut-off events. For 76/122 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3332 event pairs, 0 based on Foata normal form. 37/705 useless extension candidates. Maximal degree in co-relation 472. Up to 91 conditions per place. [2024-10-11 17:05:49,821 INFO L140 encePairwiseOnDemand]: 152/170 looper letters, 27 selfloop transitions, 9 changer transitions 4/179 dead transitions. [2024-10-11 17:05:49,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 179 transitions, 472 flow [2024-10-11 17:05:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:05:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:05:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 618 transitions. [2024-10-11 17:05:49,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9088235294117647 [2024-10-11 17:05:49,823 INFO L175 Difference]: Start difference. First operand has 167 places, 170 transitions, 367 flow. Second operand 4 states and 618 transitions. [2024-10-11 17:05:49,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 179 transitions, 472 flow [2024-10-11 17:05:49,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 179 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:49,826 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 419 flow [2024-10-11 17:05:49,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=419, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2024-10-11 17:05:49,826 INFO L277 CegarLoopForPetriNet]: 167 programPoint places, 4 predicate places. [2024-10-11 17:05:49,827 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 419 flow [2024-10-11 17:05:49,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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-10-11 17:05:49,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:49,827 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] [2024-10-11 17:05:49,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:05:49,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:05:49,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1341324667, now seen corresponding path program 1 times [2024-10-11 17:05:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:49,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127892795] [2024-10-11 17:05:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:50,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:50,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127892795] [2024-10-11 17:05:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127892795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510224973] [2024-10-11 17:05:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:50,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 170 [2024-10-11 17:05:50,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 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-10-11 17:05:50,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:50,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 170 [2024-10-11 17:05:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:52,854 INFO L124 PetriNetUnfolderBase]: 10841/30707 cut-off events. [2024-10-11 17:05:52,854 INFO L125 PetriNetUnfolderBase]: For 3258/3382 co-relation queries the response was YES. [2024-10-11 17:05:52,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49797 conditions, 30707 events. 10841/30707 cut-off events. For 3258/3382 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 345665 event pairs, 8010 based on Foata normal form. 0/27748 useless extension candidates. Maximal degree in co-relation 21957. Up to 15381 conditions per place. [2024-10-11 17:05:53,192 INFO L140 encePairwiseOnDemand]: 151/170 looper letters, 52 selfloop transitions, 54 changer transitions 0/223 dead transitions. [2024-10-11 17:05:53,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 223 transitions, 753 flow [2024-10-11 17:05:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:05:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:05:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2024-10-11 17:05:53,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.788235294117647 [2024-10-11 17:05:53,193 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 419 flow. Second operand 6 states and 804 transitions. [2024-10-11 17:05:53,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 223 transitions, 753 flow [2024-10-11 17:05:53,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 223 transitions, 751 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:53,198 INFO L231 Difference]: Finished difference. Result has 180 places, 221 transitions, 775 flow [2024-10-11 17:05:53,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=775, PETRI_PLACES=180, PETRI_TRANSITIONS=221} [2024-10-11 17:05:53,199 INFO L277 CegarLoopForPetriNet]: 167 programPoint places, 13 predicate places. [2024-10-11 17:05:53,199 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 221 transitions, 775 flow [2024-10-11 17:05:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 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-10-11 17:05:53,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:53,200 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] [2024-10-11 17:05:53,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:05:53,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:05:53,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash -63363427, now seen corresponding path program 1 times [2024-10-11 17:05:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620099304] [2024-10-11 17:05:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620099304] [2024-10-11 17:05:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620099304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518830078] [2024-10-11 17:05:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:53,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:53,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 170 [2024-10-11 17:05:53,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 221 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-10-11 17:05:53,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:53,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 170 [2024-10-11 17:05:53,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:53,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L694-2-->L694-3: Formula: (= (store |v_#race_32| |v_~#a~0.base_12| (store (select |v_#race_32| |v_~#a~0.base_12|) (+ |v_~#a~0.offset_11| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_11|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_31|, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_11|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][176], [170#true, 164#true, 166#true, 66#L694-3true, 191#(= |#race~x~0| 0), 158#L694-4true, Black: 172#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 74#L695-3true, 78#L703-10true, Black: 182#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 183#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 168#true, Black: 181#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 180#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 178#true]) [2024-10-11 17:05:53,932 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-10-11 17:05:53,932 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-11 17:05:53,932 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-11 17:05:53,932 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-11 17:05:56,835 INFO L124 PetriNetUnfolderBase]: 9522/37231 cut-off events. [2024-10-11 17:05:56,835 INFO L125 PetriNetUnfolderBase]: For 7075/7266 co-relation queries the response was YES. [2024-10-11 17:05:56,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63263 conditions, 37231 events. 9522/37231 cut-off events. For 7075/7266 co-relation queries the response was YES. Maximal size of possible extension queue 1350. Compared 495267 event pairs, 2716 based on Foata normal form. 0/33443 useless extension candidates. Maximal degree in co-relation 54044. Up to 9336 conditions per place. [2024-10-11 17:05:57,062 INFO L140 encePairwiseOnDemand]: 158/170 looper letters, 23 selfloop transitions, 9 changer transitions 0/235 dead transitions. [2024-10-11 17:05:57,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 235 transitions, 888 flow [2024-10-11 17:05:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2024-10-11 17:05:57,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2024-10-11 17:05:57,064 INFO L175 Difference]: Start difference. First operand has 180 places, 221 transitions, 775 flow. Second operand 3 states and 470 transitions. [2024-10-11 17:05:57,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 235 transitions, 888 flow [2024-10-11 17:05:57,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 235 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:05:57,136 INFO L231 Difference]: Finished difference. Result has 184 places, 230 transitions, 853 flow [2024-10-11 17:05:57,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=853, PETRI_PLACES=184, PETRI_TRANSITIONS=230} [2024-10-11 17:05:57,137 INFO L277 CegarLoopForPetriNet]: 167 programPoint places, 17 predicate places. [2024-10-11 17:05:57,137 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 230 transitions, 853 flow [2024-10-11 17:05:57,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-10-11 17:05:57,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:57,137 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-10-11 17:05:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:05:57,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:05:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1096433374, now seen corresponding path program 1 times [2024-10-11 17:05:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:57,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710038314] [2024-10-11 17:05:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710038314] [2024-10-11 17:05:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710038314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436166338] [2024-10-11 17:05:57,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:57,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:05:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:05:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:05:57,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 170 [2024-10-11 17:05:57,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 230 transitions, 853 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 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-10-11 17:05:57,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:57,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 170 [2024-10-11 17:05:57,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:00,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L694-2-->L694-3: Formula: (= (store |v_#race_32| |v_~#a~0.base_12| (store (select |v_#race_32| |v_~#a~0.base_12|) (+ |v_~#a~0.offset_11| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_11|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_31|, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_11|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][251], [Black: 189#true, 170#true, 164#true, 66#L694-3true, 166#true, 191#(= |#race~x~0| 0), 158#L694-4true, Black: 172#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 74#L695-3true, 194#true, 78#L703-10true, Black: 182#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 183#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 168#true, Black: 181#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 180#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 178#true]) [2024-10-11 17:06:00,097 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-10-11 17:06:00,097 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-11 17:06:00,097 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-11 17:06:00,097 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event