./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:56:14,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:56:14,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:56:14,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:56:14,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:56:14,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:56:14,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:56:14,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:56:14,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:56:14,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:56:14,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:56:14,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:56:14,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:56:14,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:56:14,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:56:14,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:56:14,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:56:14,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:56:14,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:56:14,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:56:14,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:56:14,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:56:14,771 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:56:14,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:56:14,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:56:14,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:56:14,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:56:14,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:56:14,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:56:14,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:56:14,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:56:14,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:14,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:56:14,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:56:14,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:56:14,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:56:14,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:56:14,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:56:14,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:56:14,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:56:14,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:56:14,775 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2024-11-19 05:56:14,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:56:14,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:56:14,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:56:14,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:56:14,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:56:14,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2024-11-19 05:56:16,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:56:16,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:56:16,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2024-11-19 05:56:16,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9aacc61/17700e8a829c420dbd55abcd16a99cae/FLAG5f30650e4 [2024-11-19 05:56:16,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9aacc61/17700e8a829c420dbd55abcd16a99cae [2024-11-19 05:56:16,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:56:16,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:56:16,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:16,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:56:16,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:56:16,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b6a544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16, skipping insertion in model container [2024-11-19 05:56:16,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:56:16,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:17,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:56:17,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:17,094 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:56:17,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17 WrapperNode [2024-11-19 05:56:17,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:17,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:17,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:56:17,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:56:17,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,174 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 488 [2024-11-19 05:56:17,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:17,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:56:17,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:56:17,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:56:17,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:56:17,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:56:17,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:56:17,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:56:17,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (1/1) ... [2024-11-19 05:56:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:17,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:56:17,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:56:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:56:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:56:17,299 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:56:17,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:56:17,299 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:56:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:56:17,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:56:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:56:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:56:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:56:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:56:17,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:56:17,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:56:17,302 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:56:17,404 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:56:17,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:56:18,030 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:56:18,030 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:56:18,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:56:18,064 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:56:18,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:18 BoogieIcfgContainer [2024-11-19 05:56:18,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:56:18,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:56:18,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:56:18,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:56:18,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:56:16" (1/3) ... [2024-11-19 05:56:18,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450d884e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:18, skipping insertion in model container [2024-11-19 05:56:18,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:17" (2/3) ... [2024-11-19 05:56:18,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450d884e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:18, skipping insertion in model container [2024-11-19 05:56:18,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:18" (3/3) ... [2024-11-19 05:56:18,073 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2024-11-19 05:56:18,086 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:56:18,087 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-19 05:56:18,087 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:56:18,200 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:56:18,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 608 places, 631 transitions, 1283 flow [2024-11-19 05:56:18,439 INFO L124 PetriNetUnfolderBase]: 33/628 cut-off events. [2024-11-19 05:56:18,439 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:18,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 628 events. 33/628 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1508 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 467. Up to 3 conditions per place. [2024-11-19 05:56:18,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 608 places, 631 transitions, 1283 flow [2024-11-19 05:56:18,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 608 transitions, 1234 flow [2024-11-19 05:56:18,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:56:18,484 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;@5a64648e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:56:18,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-19 05:56:18,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:56:18,487 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:56:18,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:56:18,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:18,488 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] [2024-11-19 05:56:18,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:18,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash -447807204, now seen corresponding path program 1 times [2024-11-19 05:56:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213625800] [2024-11-19 05:56:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213625800] [2024-11-19 05:56:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213625800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:18,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:18,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392853100] [2024-11-19 05:56:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:18,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:18,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:18,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:18,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-19 05:56:18,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 608 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:18,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:18,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-19 05:56:18,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,146 INFO L124 PetriNetUnfolderBase]: 56/1488 cut-off events. [2024-11-19 05:56:19,150 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 05:56:19,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1488 events. 56/1488 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8292 event pairs, 20 based on Foata normal form. 42/1290 useless extension candidates. Maximal degree in co-relation 1200. Up to 51 conditions per place. [2024-11-19 05:56:19,188 INFO L140 encePairwiseOnDemand]: 609/631 looper letters, 14 selfloop transitions, 2 changer transitions 7/588 dead transitions. [2024-11-19 05:56:19,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 588 transitions, 1226 flow [2024-11-19 05:56:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2024-11-19 05:56:19,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572107765451664 [2024-11-19 05:56:19,209 INFO L175 Difference]: Start difference. First operand has 587 places, 608 transitions, 1234 flow. Second operand 3 states and 1812 transitions. [2024-11-19 05:56:19,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 588 transitions, 1226 flow [2024-11-19 05:56:19,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 588 transitions, 1214 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:19,225 INFO L231 Difference]: Finished difference. Result has 582 places, 581 transitions, 1172 flow [2024-11-19 05:56:19,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=582, PETRI_TRANSITIONS=581} [2024-11-19 05:56:19,232 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2024-11-19 05:56:19,232 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 581 transitions, 1172 flow [2024-11-19 05:56:19,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,233 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] [2024-11-19 05:56:19,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:56:19,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:19,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash 929963280, now seen corresponding path program 1 times [2024-11-19 05:56:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954790993] [2024-11-19 05:56:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954790993] [2024-11-19 05:56:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954790993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346773163] [2024-11-19 05:56:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:19,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-19 05:56:19,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 581 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:19,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-19 05:56:19,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,539 INFO L124 PetriNetUnfolderBase]: 36/1024 cut-off events. [2024-11-19 05:56:19,539 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:19,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 1024 events. 36/1024 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4574 event pairs, 12 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1042. Up to 39 conditions per place. [2024-11-19 05:56:19,558 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 14 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-19 05:56:19,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2024-11-19 05:56:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-19 05:56:19,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9471737982039091 [2024-11-19 05:56:19,563 INFO L175 Difference]: Start difference. First operand has 582 places, 581 transitions, 1172 flow. Second operand 3 states and 1793 transitions. [2024-11-19 05:56:19,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2024-11-19 05:56:19,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:19,571 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1170 flow [2024-11-19 05:56:19,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2024-11-19 05:56:19,572 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2024-11-19 05:56:19,573 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1170 flow [2024-11-19 05:56:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,574 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] [2024-11-19 05:56:19,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:56:19,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:19,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash 32050057, now seen corresponding path program 1 times [2024-11-19 05:56:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160415331] [2024-11-19 05:56:19,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160415331] [2024-11-19 05:56:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160415331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472865571] [2024-11-19 05:56:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:19,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-19 05:56:19,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:19,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-19 05:56:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,857 INFO L124 PetriNetUnfolderBase]: 56/1455 cut-off events. [2024-11-19 05:56:19,857 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-11-19 05:56:19,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1455 events. 56/1455 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7781 event pairs, 20 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1475. Up to 51 conditions per place. [2024-11-19 05:56:19,880 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2024-11-19 05:56:19,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1200 flow [2024-11-19 05:56:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-19 05:56:19,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9471737982039091 [2024-11-19 05:56:19,885 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1170 flow. Second operand 3 states and 1793 transitions. [2024-11-19 05:56:19,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1200 flow [2024-11-19 05:56:19,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:19,892 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1168 flow [2024-11-19 05:56:19,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=573, PETRI_TRANSITIONS=579} [2024-11-19 05:56:19,893 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -14 predicate places. [2024-11-19 05:56:19,894 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1168 flow [2024-11-19 05:56:19,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,895 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] [2024-11-19 05:56:19,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:56:19,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1975053910, now seen corresponding path program 1 times [2024-11-19 05:56:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70847737] [2024-11-19 05:56:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70847737] [2024-11-19 05:56:19,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70847737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899870322] [2024-11-19 05:56:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:19,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:19,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-19 05:56:19,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:19,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-19 05:56:19,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:20,254 INFO L124 PetriNetUnfolderBase]: 132/2496 cut-off events. [2024-11-19 05:56:20,254 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:56:20,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 2496 events. 132/2496 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18546 event pairs, 64 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2621. Up to 138 conditions per place. [2024-11-19 05:56:20,293 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2024-11-19 05:56:20,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1192 flow [2024-11-19 05:56:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-19 05:56:20,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-19 05:56:20,297 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1168 flow. Second operand 3 states and 1786 transitions. [2024-11-19 05:56:20,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1192 flow [2024-11-19 05:56:20,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:20,303 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2024-11-19 05:56:20,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2024-11-19 05:56:20,305 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2024-11-19 05:56:20,306 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2024-11-19 05:56:20,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:20,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:20,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:20,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:56:20,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:20,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1023932628, now seen corresponding path program 1 times [2024-11-19 05:56:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:20,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471538036] [2024-11-19 05:56:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471538036] [2024-11-19 05:56:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471538036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131182772] [2024-11-19 05:56:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:20,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:20,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:20,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:21,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 631 [2024-11-19 05:56:21,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1156 flow. Second operand has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:21,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 631 [2024-11-19 05:56:21,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:28,194 INFO L124 PetriNetUnfolderBase]: 12107/56176 cut-off events. [2024-11-19 05:56:28,194 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-19 05:56:28,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73657 conditions, 56176 events. 12107/56176 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 784819 event pairs, 10080 based on Foata normal form. 0/48921 useless extension candidates. Maximal degree in co-relation 73608. Up to 17156 conditions per place. [2024-11-19 05:56:28,578 INFO L140 encePairwiseOnDemand]: 613/631 looper letters, 78 selfloop transitions, 15 changer transitions 0/571 dead transitions. [2024-11-19 05:56:28,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 571 transitions, 1336 flow [2024-11-19 05:56:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3180 transitions. [2024-11-19 05:56:28,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8399366085578447 [2024-11-19 05:56:28,585 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 6 states and 3180 transitions. [2024-11-19 05:56:28,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 571 transitions, 1336 flow [2024-11-19 05:56:28,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 571 transitions, 1335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:28,592 INFO L231 Difference]: Finished difference. Result has 569 places, 571 transitions, 1179 flow [2024-11-19 05:56:28,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1179, PETRI_PLACES=569, PETRI_TRANSITIONS=571} [2024-11-19 05:56:28,594 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2024-11-19 05:56:28,596 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 571 transitions, 1179 flow [2024-11-19 05:56:28,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:28,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:28,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:28,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:56:28,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:28,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1772920805, now seen corresponding path program 1 times [2024-11-19 05:56:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162500071] [2024-11-19 05:56:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:28,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162500071] [2024-11-19 05:56:28,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162500071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:28,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:28,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580717495] [2024-11-19 05:56:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:28,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:28,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:28,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-19 05:56:28,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 571 transitions, 1179 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:28,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:28,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-19 05:56:28,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:28,984 INFO L124 PetriNetUnfolderBase]: 62/1744 cut-off events. [2024-11-19 05:56:28,984 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:56:28,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1744 events. 62/1744 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9892 event pairs, 20 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1779. Up to 50 conditions per place. [2024-11-19 05:56:29,005 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2024-11-19 05:56:29,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 570 transitions, 1207 flow [2024-11-19 05:56:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-19 05:56:29,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-19 05:56:29,009 INFO L175 Difference]: Start difference. First operand has 569 places, 571 transitions, 1179 flow. Second operand 3 states and 1795 transitions. [2024-11-19 05:56:29,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 570 transitions, 1207 flow [2024-11-19 05:56:29,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 570 transitions, 1177 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:29,015 INFO L231 Difference]: Finished difference. Result has 565 places, 570 transitions, 1151 flow [2024-11-19 05:56:29,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1151, PETRI_PLACES=565, PETRI_TRANSITIONS=570} [2024-11-19 05:56:29,018 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -22 predicate places. [2024-11-19 05:56:29,018 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 570 transitions, 1151 flow [2024-11-19 05:56:29,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:29,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:29,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:56:29,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2097705736, now seen corresponding path program 1 times [2024-11-19 05:56:29,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:29,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933912806] [2024-11-19 05:56:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:29,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933912806] [2024-11-19 05:56:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933912806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:29,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:29,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008187166] [2024-11-19 05:56:29,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:29,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:29,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-19 05:56:29,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 570 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:29,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-19 05:56:29,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:29,261 INFO L124 PetriNetUnfolderBase]: 78/1635 cut-off events. [2024-11-19 05:56:29,261 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 05:56:29,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 1635 events. 78/1635 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9883 event pairs, 32 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 1690. Up to 87 conditions per place. [2024-11-19 05:56:29,293 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2024-11-19 05:56:29,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 565 transitions, 1175 flow [2024-11-19 05:56:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-19 05:56:29,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-19 05:56:29,296 INFO L175 Difference]: Start difference. First operand has 565 places, 570 transitions, 1151 flow. Second operand 3 states and 1786 transitions. [2024-11-19 05:56:29,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 565 transitions, 1175 flow [2024-11-19 05:56:29,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 565 transitions, 1171 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:29,302 INFO L231 Difference]: Finished difference. Result has 560 places, 565 transitions, 1139 flow [2024-11-19 05:56:29,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=560, PETRI_TRANSITIONS=565} [2024-11-19 05:56:29,303 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2024-11-19 05:56:29,303 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 565 transitions, 1139 flow [2024-11-19 05:56:29,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,305 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:29,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:29,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:56:29,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:29,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash -531904196, now seen corresponding path program 1 times [2024-11-19 05:56:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830558268] [2024-11-19 05:56:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:29,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:29,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830558268] [2024-11-19 05:56:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830558268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:29,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:29,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198457250] [2024-11-19 05:56:29,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:29,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:29,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:29,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:29,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:29,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-19 05:56:29,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 565 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:29,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-19 05:56:29,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:29,481 INFO L124 PetriNetUnfolderBase]: 36/1038 cut-off events. [2024-11-19 05:56:29,481 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:56:29,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 1038 events. 36/1038 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4402 event pairs, 12 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2024-11-19 05:56:29,494 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2024-11-19 05:56:29,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 564 transitions, 1167 flow [2024-11-19 05:56:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-19 05:56:29,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-19 05:56:29,497 INFO L175 Difference]: Start difference. First operand has 560 places, 565 transitions, 1139 flow. Second operand 3 states and 1795 transitions. [2024-11-19 05:56:29,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 564 transitions, 1167 flow [2024-11-19 05:56:29,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 564 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:29,504 INFO L231 Difference]: Finished difference. Result has 560 places, 564 transitions, 1140 flow [2024-11-19 05:56:29,504 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=560, PETRI_TRANSITIONS=564} [2024-11-19 05:56:29,506 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2024-11-19 05:56:29,506 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 564 transitions, 1140 flow [2024-11-19 05:56:29,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:29,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:29,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:56:29,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash -652471666, now seen corresponding path program 1 times [2024-11-19 05:56:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42161565] [2024-11-19 05:56:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42161565] [2024-11-19 05:56:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42161565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788129871] [2024-11-19 05:56:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:29,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:29,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:29,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-19 05:56:29,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 564 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:29,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-19 05:56:29,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:29,891 INFO L124 PetriNetUnfolderBase]: 136/2442 cut-off events. [2024-11-19 05:56:29,891 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2024-11-19 05:56:29,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 2442 events. 136/2442 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17707 event pairs, 64 based on Foata normal form. 0/2112 useless extension candidates. Maximal degree in co-relation 2548. Up to 141 conditions per place. [2024-11-19 05:56:29,934 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2024-11-19 05:56:29,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 559 transitions, 1164 flow [2024-11-19 05:56:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-19 05:56:29,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-19 05:56:29,938 INFO L175 Difference]: Start difference. First operand has 560 places, 564 transitions, 1140 flow. Second operand 3 states and 1786 transitions. [2024-11-19 05:56:29,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 559 transitions, 1164 flow [2024-11-19 05:56:29,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 559 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:29,945 INFO L231 Difference]: Finished difference. Result has 555 places, 559 transitions, 1128 flow [2024-11-19 05:56:29,945 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=555, PETRI_TRANSITIONS=559} [2024-11-19 05:56:29,946 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-19 05:56:29,946 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 559 transitions, 1128 flow [2024-11-19 05:56:29,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:29,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:29,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:56:29,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:29,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1387397697, now seen corresponding path program 1 times [2024-11-19 05:56:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:29,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218168272] [2024-11-19 05:56:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:29,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218168272] [2024-11-19 05:56:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218168272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:29,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:29,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:29,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598684616] [2024-11-19 05:56:29,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:29,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:29,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:30,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-19 05:56:30,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 559 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:30,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-19 05:56:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:30,191 INFO L124 PetriNetUnfolderBase]: 38/810 cut-off events. [2024-11-19 05:56:30,192 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-19 05:56:30,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 810 events. 38/810 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3028 event pairs, 20 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2024-11-19 05:56:30,202 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-19 05:56:30,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1156 flow [2024-11-19 05:56:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-19 05:56:30,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-19 05:56:30,206 INFO L175 Difference]: Start difference. First operand has 555 places, 559 transitions, 1128 flow. Second operand 3 states and 1795 transitions. [2024-11-19 05:56:30,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1156 flow [2024-11-19 05:56:30,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:30,211 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1129 flow [2024-11-19 05:56:30,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1129, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2024-11-19 05:56:30,213 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-19 05:56:30,213 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1129 flow [2024-11-19 05:56:30,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:30,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:30,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:56:30,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:30,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1341973257, now seen corresponding path program 1 times [2024-11-19 05:56:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208014072] [2024-11-19 05:56:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208014072] [2024-11-19 05:56:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208014072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:30,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:30,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:30,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856556073] [2024-11-19 05:56:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:30,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:30,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:30,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 631 [2024-11-19 05:56:30,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:30,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 631 [2024-11-19 05:56:30,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:30,368 INFO L124 PetriNetUnfolderBase]: 34/990 cut-off events. [2024-11-19 05:56:30,369 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:56:30,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 990 events. 34/990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4345 event pairs, 6 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 994. Up to 23 conditions per place. [2024-11-19 05:56:30,383 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 12 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-19 05:56:30,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 559 transitions, 1161 flow [2024-11-19 05:56:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-19 05:56:30,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-19 05:56:30,387 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1129 flow. Second operand 3 states and 1806 transitions. [2024-11-19 05:56:30,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 559 transitions, 1161 flow [2024-11-19 05:56:30,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 559 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:30,396 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1127 flow [2024-11-19 05:56:30,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2024-11-19 05:56:30,397 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2024-11-19 05:56:30,397 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1127 flow [2024-11-19 05:56:30,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:30,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:30,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:56:30,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2126152066, now seen corresponding path program 1 times [2024-11-19 05:56:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491779747] [2024-11-19 05:56:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:30,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491779747] [2024-11-19 05:56:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491779747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331273427] [2024-11-19 05:56:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:30,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:30,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:30,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:30,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:30,560 INFO L124 PetriNetUnfolderBase]: 31/876 cut-off events. [2024-11-19 05:56:30,560 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-19 05:56:30,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 876 events. 31/876 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3404 event pairs, 6 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2024-11-19 05:56:30,576 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-19 05:56:30,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 558 transitions, 1161 flow [2024-11-19 05:56:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-19 05:56:30,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-19 05:56:30,579 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1127 flow. Second operand 3 states and 1804 transitions. [2024-11-19 05:56:30,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 558 transitions, 1161 flow [2024-11-19 05:56:30,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:30,586 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1125 flow [2024-11-19 05:56:30,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2024-11-19 05:56:30,587 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2024-11-19 05:56:30,588 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1125 flow [2024-11-19 05:56:30,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:30,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:30,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:56:30,589 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:30,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1305878310, now seen corresponding path program 1 times [2024-11-19 05:56:30,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:30,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502585668] [2024-11-19 05:56:30,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:30,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502585668] [2024-11-19 05:56:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502585668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:30,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:30,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:30,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558344166] [2024-11-19 05:56:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:30,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:30,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:30,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:30,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:30,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:30,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:30,736 INFO L124 PetriNetUnfolderBase]: 40/991 cut-off events. [2024-11-19 05:56:30,736 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-11-19 05:56:30,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 991 events. 40/991 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4307 event pairs, 12 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 1022. Up to 39 conditions per place. [2024-11-19 05:56:30,749 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2024-11-19 05:56:30,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 559 transitions, 1167 flow [2024-11-19 05:56:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-19 05:56:30,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-19 05:56:30,752 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1125 flow. Second operand 3 states and 1806 transitions. [2024-11-19 05:56:30,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 559 transitions, 1167 flow [2024-11-19 05:56:30,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 559 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:30,761 INFO L231 Difference]: Finished difference. Result has 555 places, 557 transitions, 1139 flow [2024-11-19 05:56:30,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=555, PETRI_TRANSITIONS=557} [2024-11-19 05:56:30,762 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-19 05:56:30,763 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 557 transitions, 1139 flow [2024-11-19 05:56:30,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:30,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:30,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:56:30,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:30,765 INFO L85 PathProgramCache]: Analyzing trace with hash 327144343, now seen corresponding path program 1 times [2024-11-19 05:56:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:30,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318856704] [2024-11-19 05:56:30,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:30,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:30,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318856704] [2024-11-19 05:56:30,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318856704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:30,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:30,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139433027] [2024-11-19 05:56:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:30,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:30,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-19 05:56:30,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 557 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:30,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-19 05:56:30,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:31,058 INFO L124 PetriNetUnfolderBase]: 131/2146 cut-off events. [2024-11-19 05:56:31,058 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-19 05:56:31,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 2146 events. 131/2146 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14800 event pairs, 24 based on Foata normal form. 0/1905 useless extension candidates. Maximal degree in co-relation 2343. Up to 154 conditions per place. [2024-11-19 05:56:31,092 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 20 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2024-11-19 05:56:31,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 560 transitions, 1194 flow [2024-11-19 05:56:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-19 05:56:31,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9503433703116746 [2024-11-19 05:56:31,096 INFO L175 Difference]: Start difference. First operand has 555 places, 557 transitions, 1139 flow. Second operand 3 states and 1799 transitions. [2024-11-19 05:56:31,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 560 transitions, 1194 flow [2024-11-19 05:56:31,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 560 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:31,103 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1139 flow [2024-11-19 05:56:31,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2024-11-19 05:56:31,105 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -35 predicate places. [2024-11-19 05:56:31,105 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1139 flow [2024-11-19 05:56:31,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:31,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:31,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:31,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:56:31,106 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:31,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1801575874, now seen corresponding path program 1 times [2024-11-19 05:56:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949995661] [2024-11-19 05:56:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949995661] [2024-11-19 05:56:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949995661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:31,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828898077] [2024-11-19 05:56:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:31,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:31,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:31,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:31,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:31,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:31,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:31,320 INFO L124 PetriNetUnfolderBase]: 63/1137 cut-off events. [2024-11-19 05:56:31,321 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2024-11-19 05:56:31,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1137 events. 63/1137 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5464 event pairs, 12 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1187. Up to 49 conditions per place. [2024-11-19 05:56:31,340 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-11-19 05:56:31,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 556 transitions, 1173 flow [2024-11-19 05:56:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-19 05:56:31,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-19 05:56:31,344 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1139 flow. Second operand 3 states and 1804 transitions. [2024-11-19 05:56:31,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 556 transitions, 1173 flow [2024-11-19 05:56:31,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1173 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:31,352 INFO L231 Difference]: Finished difference. Result has 553 places, 554 transitions, 1141 flow [2024-11-19 05:56:31,353 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1141, PETRI_PLACES=553, PETRI_TRANSITIONS=554} [2024-11-19 05:56:31,354 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2024-11-19 05:56:31,354 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 554 transitions, 1141 flow [2024-11-19 05:56:31,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:31,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:31,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:31,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:56:31,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1148090203, now seen corresponding path program 1 times [2024-11-19 05:56:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316885412] [2024-11-19 05:56:31,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316885412] [2024-11-19 05:56:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316885412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:31,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:31,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917633812] [2024-11-19 05:56:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:31,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:32,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-19 05:56:32,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 554 transitions, 1141 flow. Second operand has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:32,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:32,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-19 05:56:32,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:32,426 INFO L124 PetriNetUnfolderBase]: 98/1577 cut-off events. [2024-11-19 05:56:32,426 INFO L125 PetriNetUnfolderBase]: For 6/38 co-relation queries the response was YES. [2024-11-19 05:56:32,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 1577 events. 98/1577 cut-off events. For 6/38 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8549 event pairs, 45 based on Foata normal form. 5/1448 useless extension candidates. Maximal degree in co-relation 1893. Up to 158 conditions per place. [2024-11-19 05:56:32,451 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 69 selfloop transitions, 15 changer transitions 0/592 dead transitions. [2024-11-19 05:56:32,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 592 transitions, 1401 flow [2024-11-19 05:56:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2024-11-19 05:56:32,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9075061230370264 [2024-11-19 05:56:32,461 INFO L175 Difference]: Start difference. First operand has 553 places, 554 transitions, 1141 flow. Second operand 11 states and 6299 transitions. [2024-11-19 05:56:32,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 592 transitions, 1401 flow [2024-11-19 05:56:32,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 592 transitions, 1397 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:32,469 INFO L231 Difference]: Finished difference. Result has 566 places, 562 transitions, 1213 flow [2024-11-19 05:56:32,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1213, PETRI_PLACES=566, PETRI_TRANSITIONS=562} [2024-11-19 05:56:32,470 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -21 predicate places. [2024-11-19 05:56:32,470 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 562 transitions, 1213 flow [2024-11-19 05:56:32,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:32,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:32,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:56:32,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:32,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash -91014793, now seen corresponding path program 1 times [2024-11-19 05:56:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:32,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448757891] [2024-11-19 05:56:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:32,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448757891] [2024-11-19 05:56:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448757891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377575778] [2024-11-19 05:56:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:32,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:32,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:32,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:32,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 562 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:32,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:32,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:32,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:32,845 INFO L124 PetriNetUnfolderBase]: 132/1836 cut-off events. [2024-11-19 05:56:32,845 INFO L125 PetriNetUnfolderBase]: For 91/154 co-relation queries the response was YES. [2024-11-19 05:56:32,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 1836 events. 132/1836 cut-off events. For 91/154 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10819 event pairs, 48 based on Foata normal form. 0/1618 useless extension candidates. Maximal degree in co-relation 2062. Up to 149 conditions per place. [2024-11-19 05:56:32,872 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2024-11-19 05:56:32,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 565 transitions, 1255 flow [2024-11-19 05:56:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-19 05:56:32,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-19 05:56:32,876 INFO L175 Difference]: Start difference. First operand has 566 places, 562 transitions, 1213 flow. Second operand 3 states and 1806 transitions. [2024-11-19 05:56:32,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 565 transitions, 1255 flow [2024-11-19 05:56:32,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 565 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:32,883 INFO L231 Difference]: Finished difference. Result has 569 places, 563 transitions, 1227 flow [2024-11-19 05:56:32,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=569, PETRI_TRANSITIONS=563} [2024-11-19 05:56:32,884 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2024-11-19 05:56:32,884 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 563 transitions, 1227 flow [2024-11-19 05:56:32,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:32,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:32,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:32,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:56:32,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:32,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:32,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1168322408, now seen corresponding path program 1 times [2024-11-19 05:56:32,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:32,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413702027] [2024-11-19 05:56:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:32,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:32,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413702027] [2024-11-19 05:56:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413702027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:32,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:32,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:32,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643087408] [2024-11-19 05:56:32,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:32,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:32,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:32,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:32,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:32,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:32,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 563 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:32,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:32,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:32,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:33,313 INFO L124 PetriNetUnfolderBase]: 137/1985 cut-off events. [2024-11-19 05:56:33,313 INFO L125 PetriNetUnfolderBase]: For 68/101 co-relation queries the response was YES. [2024-11-19 05:56:33,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 1985 events. 137/1985 cut-off events. For 68/101 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13012 event pairs, 48 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 2307. Up to 152 conditions per place. [2024-11-19 05:56:33,350 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/566 dead transitions. [2024-11-19 05:56:33,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 566 transitions, 1269 flow [2024-11-19 05:56:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-19 05:56:33,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-19 05:56:33,353 INFO L175 Difference]: Start difference. First operand has 569 places, 563 transitions, 1227 flow. Second operand 3 states and 1806 transitions. [2024-11-19 05:56:33,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 566 transitions, 1269 flow [2024-11-19 05:56:33,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 566 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:33,361 INFO L231 Difference]: Finished difference. Result has 571 places, 564 transitions, 1239 flow [2024-11-19 05:56:33,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=571, PETRI_TRANSITIONS=564} [2024-11-19 05:56:33,362 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -16 predicate places. [2024-11-19 05:56:33,362 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 564 transitions, 1239 flow [2024-11-19 05:56:33,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:33,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:33,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:33,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:56:33,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash -576927796, now seen corresponding path program 1 times [2024-11-19 05:56:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863293337] [2024-11-19 05:56:33,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863293337] [2024-11-19 05:56:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863293337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:33,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:33,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029900232] [2024-11-19 05:56:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:33,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:33,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:33,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-19 05:56:33,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 564 transitions, 1239 flow. Second operand has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:33,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:33,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-19 05:56:33,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:34,027 INFO L124 PetriNetUnfolderBase]: 187/3283 cut-off events. [2024-11-19 05:56:34,027 INFO L125 PetriNetUnfolderBase]: For 58/76 co-relation queries the response was YES. [2024-11-19 05:56:34,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3793 conditions, 3283 events. 187/3283 cut-off events. For 58/76 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 25315 event pairs, 33 based on Foata normal form. 0/2960 useless extension candidates. Maximal degree in co-relation 3733. Up to 220 conditions per place. [2024-11-19 05:56:34,084 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 20 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2024-11-19 05:56:34,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 567 transitions, 1294 flow [2024-11-19 05:56:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-19 05:56:34,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9503433703116746 [2024-11-19 05:56:34,089 INFO L175 Difference]: Start difference. First operand has 571 places, 564 transitions, 1239 flow. Second operand 3 states and 1799 transitions. [2024-11-19 05:56:34,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 567 transitions, 1294 flow [2024-11-19 05:56:34,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 567 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:34,103 INFO L231 Difference]: Finished difference. Result has 568 places, 562 transitions, 1239 flow [2024-11-19 05:56:34,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=568, PETRI_TRANSITIONS=562} [2024-11-19 05:56:34,104 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2024-11-19 05:56:34,104 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 562 transitions, 1239 flow [2024-11-19 05:56:34,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:34,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:34,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:34,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:56:34,105 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:34,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1697505040, now seen corresponding path program 1 times [2024-11-19 05:56:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035168378] [2024-11-19 05:56:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035168378] [2024-11-19 05:56:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035168378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:34,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963875169] [2024-11-19 05:56:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:34,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-19 05:56:34,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 562 transitions, 1239 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:34,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:34,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-19 05:56:34,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:35,299 INFO L124 PetriNetUnfolderBase]: 170/2424 cut-off events. [2024-11-19 05:56:35,299 INFO L125 PetriNetUnfolderBase]: For 82/134 co-relation queries the response was YES. [2024-11-19 05:56:35,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 2424 events. 170/2424 cut-off events. For 82/134 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 16324 event pairs, 79 based on Foata normal form. 3/2187 useless extension candidates. Maximal degree in co-relation 2962. Up to 259 conditions per place. [2024-11-19 05:56:35,338 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 69 selfloop transitions, 15 changer transitions 0/595 dead transitions. [2024-11-19 05:56:35,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 595 transitions, 1489 flow [2024-11-19 05:56:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2024-11-19 05:56:35,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9075061230370264 [2024-11-19 05:56:35,346 INFO L175 Difference]: Start difference. First operand has 568 places, 562 transitions, 1239 flow. Second operand 11 states and 6299 transitions. [2024-11-19 05:56:35,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 595 transitions, 1489 flow [2024-11-19 05:56:35,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 595 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:35,354 INFO L231 Difference]: Finished difference. Result has 581 places, 565 transitions, 1294 flow [2024-11-19 05:56:35,354 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=581, PETRI_TRANSITIONS=565} [2024-11-19 05:56:35,355 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -6 predicate places. [2024-11-19 05:56:35,355 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 565 transitions, 1294 flow [2024-11-19 05:56:35,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:35,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:35,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:35,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:56:35,356 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 54425104, now seen corresponding path program 1 times [2024-11-19 05:56:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621228099] [2024-11-19 05:56:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621228099] [2024-11-19 05:56:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621228099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:35,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988670637] [2024-11-19 05:56:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:35,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:35,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:35,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-19 05:56:35,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 565 transitions, 1294 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:35,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:35,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-19 05:56:35,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:36,536 INFO L124 PetriNetUnfolderBase]: 245/3127 cut-off events. [2024-11-19 05:56:36,536 INFO L125 PetriNetUnfolderBase]: For 227/285 co-relation queries the response was YES. [2024-11-19 05:56:36,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 3127 events. 245/3127 cut-off events. For 227/285 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 24221 event pairs, 103 based on Foata normal form. 10/2849 useless extension candidates. Maximal degree in co-relation 3915. Up to 347 conditions per place. [2024-11-19 05:56:36,582 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 65 selfloop transitions, 15 changer transitions 0/594 dead transitions. [2024-11-19 05:56:36,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 594 transitions, 1528 flow [2024-11-19 05:56:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6290 transitions. [2024-11-19 05:56:36,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9062094799020314 [2024-11-19 05:56:36,590 INFO L175 Difference]: Start difference. First operand has 581 places, 565 transitions, 1294 flow. Second operand 11 states and 6290 transitions. [2024-11-19 05:56:36,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 594 transitions, 1528 flow [2024-11-19 05:56:36,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1507 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:56:36,599 INFO L231 Difference]: Finished difference. Result has 589 places, 573 transitions, 1349 flow [2024-11-19 05:56:36,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1349, PETRI_PLACES=589, PETRI_TRANSITIONS=573} [2024-11-19 05:56:36,600 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 2 predicate places. [2024-11-19 05:56:36,600 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 573 transitions, 1349 flow [2024-11-19 05:56:36,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:36,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:36,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:36,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:56:36,602 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1256598994, now seen corresponding path program 1 times [2024-11-19 05:56:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:36,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078257918] [2024-11-19 05:56:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078257918] [2024-11-19 05:56:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078257918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:36,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:36,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665835058] [2024-11-19 05:56:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:36,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:37,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-19 05:56:37,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 573 transitions, 1349 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:37,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:37,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-19 05:56:37,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:37,754 INFO L124 PetriNetUnfolderBase]: 147/2380 cut-off events. [2024-11-19 05:56:37,754 INFO L125 PetriNetUnfolderBase]: For 118/172 co-relation queries the response was YES. [2024-11-19 05:56:37,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 2380 events. 147/2380 cut-off events. For 118/172 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 15183 event pairs, 55 based on Foata normal form. 2/2219 useless extension candidates. Maximal degree in co-relation 3157. Up to 233 conditions per place. [2024-11-19 05:56:37,785 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 71 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2024-11-19 05:56:37,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 603 transitions, 1627 flow [2024-11-19 05:56:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6292 transitions. [2024-11-19 05:56:37,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9064976228209192 [2024-11-19 05:56:37,794 INFO L175 Difference]: Start difference. First operand has 589 places, 573 transitions, 1349 flow. Second operand 11 states and 6292 transitions. [2024-11-19 05:56:37,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 603 transitions, 1627 flow [2024-11-19 05:56:37,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 603 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:37,804 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1440 flow [2024-11-19 05:56:37,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1440, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2024-11-19 05:56:37,805 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2024-11-19 05:56:37,805 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1440 flow [2024-11-19 05:56:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:37,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:37,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:37,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:56:37,806 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:37,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:37,807 INFO L85 PathProgramCache]: Analyzing trace with hash -248585689, now seen corresponding path program 1 times [2024-11-19 05:56:37,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:37,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581138296] [2024-11-19 05:56:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:37,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581138296] [2024-11-19 05:56:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581138296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250399740] [2024-11-19 05:56:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:37,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:37,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:37,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:37,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:38,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-19 05:56:38,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1440 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:38,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:38,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-19 05:56:38,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:39,387 INFO L124 PetriNetUnfolderBase]: 338/4947 cut-off events. [2024-11-19 05:56:39,387 INFO L125 PetriNetUnfolderBase]: For 466/624 co-relation queries the response was YES. [2024-11-19 05:56:39,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 4947 events. 338/4947 cut-off events. For 466/624 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42978 event pairs, 159 based on Foata normal form. 2/4532 useless extension candidates. Maximal degree in co-relation 6594. Up to 453 conditions per place. [2024-11-19 05:56:39,470 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 67 selfloop transitions, 18 changer transitions 0/605 dead transitions. [2024-11-19 05:56:39,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 605 transitions, 1702 flow [2024-11-19 05:56:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2024-11-19 05:56:39,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9052009796859242 [2024-11-19 05:56:39,476 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1440 flow. Second operand 11 states and 6283 transitions. [2024-11-19 05:56:39,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 605 transitions, 1702 flow [2024-11-19 05:56:39,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 605 transitions, 1681 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:56:39,488 INFO L231 Difference]: Finished difference. Result has 609 places, 590 transitions, 1535 flow [2024-11-19 05:56:39,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1535, PETRI_PLACES=609, PETRI_TRANSITIONS=590} [2024-11-19 05:56:39,489 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 22 predicate places. [2024-11-19 05:56:39,489 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 590 transitions, 1535 flow [2024-11-19 05:56:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:39,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:39,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:39,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:56:39,490 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:39,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1817558710, now seen corresponding path program 1 times [2024-11-19 05:56:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191045033] [2024-11-19 05:56:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191045033] [2024-11-19 05:56:39,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191045033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:39,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:39,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146263885] [2024-11-19 05:56:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:39,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:39,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:40,041 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-19 05:56:40,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 590 transitions, 1535 flow. Second operand has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:40,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:40,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-19 05:56:40,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:40,804 INFO L124 PetriNetUnfolderBase]: 296/3695 cut-off events. [2024-11-19 05:56:40,804 INFO L125 PetriNetUnfolderBase]: For 622/681 co-relation queries the response was YES. [2024-11-19 05:56:40,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5215 conditions, 3695 events. 296/3695 cut-off events. For 622/681 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 30160 event pairs, 127 based on Foata normal form. 0/3423 useless extension candidates. Maximal degree in co-relation 5127. Up to 433 conditions per place. [2024-11-19 05:56:40,858 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 67 selfloop transitions, 18 changer transitions 0/611 dead transitions. [2024-11-19 05:56:40,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 611 transitions, 1787 flow [2024-11-19 05:56:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2024-11-19 05:56:40,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9052009796859242 [2024-11-19 05:56:40,863 INFO L175 Difference]: Start difference. First operand has 609 places, 590 transitions, 1535 flow. Second operand 11 states and 6283 transitions. [2024-11-19 05:56:40,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 611 transitions, 1787 flow [2024-11-19 05:56:40,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 611 transitions, 1783 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:40,875 INFO L231 Difference]: Finished difference. Result has 621 places, 596 transitions, 1626 flow [2024-11-19 05:56:40,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1626, PETRI_PLACES=621, PETRI_TRANSITIONS=596} [2024-11-19 05:56:40,875 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 34 predicate places. [2024-11-19 05:56:40,876 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 596 transitions, 1626 flow [2024-11-19 05:56:40,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:40,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:40,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:40,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:56:40,877 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:40,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1086944830, now seen corresponding path program 1 times [2024-11-19 05:56:40,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:40,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381486752] [2024-11-19 05:56:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381486752] [2024-11-19 05:56:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381486752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:41,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:41,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415442735] [2024-11-19 05:56:41,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:41,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:41,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:41,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:41,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:41,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-19 05:56:41,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 596 transitions, 1626 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:41,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:41,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-19 05:56:41,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:42,440 INFO L124 PetriNetUnfolderBase]: 157/3538 cut-off events. [2024-11-19 05:56:42,440 INFO L125 PetriNetUnfolderBase]: For 561/605 co-relation queries the response was YES. [2024-11-19 05:56:42,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 3538 events. 157/3538 cut-off events. For 561/605 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 25918 event pairs, 22 based on Foata normal form. 12/3338 useless extension candidates. Maximal degree in co-relation 4894. Up to 173 conditions per place. [2024-11-19 05:56:42,486 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 41 selfloop transitions, 5 changer transitions 0/605 dead transitions. [2024-11-19 05:56:42,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 605 transitions, 1747 flow [2024-11-19 05:56:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2024-11-19 05:56:42,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9247226624405706 [2024-11-19 05:56:42,490 INFO L175 Difference]: Start difference. First operand has 621 places, 596 transitions, 1626 flow. Second operand 6 states and 3501 transitions. [2024-11-19 05:56:42,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 605 transitions, 1747 flow [2024-11-19 05:56:42,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 605 transitions, 1726 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:56:42,502 INFO L231 Difference]: Finished difference. Result has 617 places, 594 transitions, 1611 flow [2024-11-19 05:56:42,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1611, PETRI_PLACES=617, PETRI_TRANSITIONS=594} [2024-11-19 05:56:42,503 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 30 predicate places. [2024-11-19 05:56:42,503 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 594 transitions, 1611 flow [2024-11-19 05:56:42,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:42,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:42,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:42,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 05:56:42,505 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:42,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1412690005, now seen corresponding path program 1 times [2024-11-19 05:56:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145630429] [2024-11-19 05:56:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145630429] [2024-11-19 05:56:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145630429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548557662] [2024-11-19 05:56:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:43,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-19 05:56:43,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 594 transitions, 1611 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-19 05:56:43,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:44,305 INFO L124 PetriNetUnfolderBase]: 186/3895 cut-off events. [2024-11-19 05:56:44,306 INFO L125 PetriNetUnfolderBase]: For 644/742 co-relation queries the response was YES. [2024-11-19 05:56:44,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 3895 events. 186/3895 cut-off events. For 644/742 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 30421 event pairs, 30 based on Foata normal form. 8/3651 useless extension candidates. Maximal degree in co-relation 5332. Up to 197 conditions per place. [2024-11-19 05:56:44,372 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 40 selfloop transitions, 5 changer transitions 0/602 dead transitions. [2024-11-19 05:56:44,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 602 transitions, 1727 flow [2024-11-19 05:56:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2024-11-19 05:56:44,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9244585314315901 [2024-11-19 05:56:44,376 INFO L175 Difference]: Start difference. First operand has 617 places, 594 transitions, 1611 flow. Second operand 6 states and 3500 transitions. [2024-11-19 05:56:44,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 602 transitions, 1727 flow [2024-11-19 05:56:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 602 transitions, 1717 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:44,389 INFO L231 Difference]: Finished difference. Result has 615 places, 592 transitions, 1607 flow [2024-11-19 05:56:44,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1607, PETRI_PLACES=615, PETRI_TRANSITIONS=592} [2024-11-19 05:56:44,390 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 28 predicate places. [2024-11-19 05:56:44,390 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 592 transitions, 1607 flow [2024-11-19 05:56:44,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:44,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:44,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:56:44,391 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:44,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash -385378515, now seen corresponding path program 1 times [2024-11-19 05:56:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983484855] [2024-11-19 05:56:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983484855] [2024-11-19 05:56:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983484855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:44,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925929105] [2024-11-19 05:56:44,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:44,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:44,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-19 05:56:44,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 592 transitions, 1607 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:44,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:44,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-19 05:56:44,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:45,348 INFO L124 PetriNetUnfolderBase]: 328/6084 cut-off events. [2024-11-19 05:56:45,348 INFO L125 PetriNetUnfolderBase]: For 458/478 co-relation queries the response was YES. [2024-11-19 05:56:45,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7705 conditions, 6084 events. 328/6084 cut-off events. For 458/478 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 54570 event pairs, 55 based on Foata normal form. 0/5641 useless extension candidates. Maximal degree in co-relation 7615. Up to 393 conditions per place. [2024-11-19 05:56:45,420 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 19 selfloop transitions, 2 changer transitions 0/594 dead transitions. [2024-11-19 05:56:45,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 594 transitions, 1657 flow [2024-11-19 05:56:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-19 05:56:45,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498151082937136 [2024-11-19 05:56:45,421 INFO L175 Difference]: Start difference. First operand has 615 places, 592 transitions, 1607 flow. Second operand 3 states and 1798 transitions. [2024-11-19 05:56:45,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 594 transitions, 1657 flow [2024-11-19 05:56:45,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 594 transitions, 1647 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:45,431 INFO L231 Difference]: Finished difference. Result has 609 places, 590 transitions, 1603 flow [2024-11-19 05:56:45,431 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1603, PETRI_PLACES=609, PETRI_TRANSITIONS=590} [2024-11-19 05:56:45,432 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 22 predicate places. [2024-11-19 05:56:45,432 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 590 transitions, 1603 flow [2024-11-19 05:56:45,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:45,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:45,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:45,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:56:45,432 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:45,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1246765924, now seen corresponding path program 1 times [2024-11-19 05:56:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39830247] [2024-11-19 05:56:45,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39830247] [2024-11-19 05:56:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39830247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:45,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767878027] [2024-11-19 05:56:45,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:46,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-19 05:56:46,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 590 transitions, 1603 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:46,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:46,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-19 05:56:46,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:46,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1753] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][331], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 655#true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), 461#L105true, Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#true, Black: 697#true]) [2024-11-19 05:56:46,603 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-19 05:56:46,603 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:56:46,603 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:56:46,603 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-19 05:56:46,623 INFO L124 PetriNetUnfolderBase]: 161/3896 cut-off events. [2024-11-19 05:56:46,623 INFO L125 PetriNetUnfolderBase]: For 546/602 co-relation queries the response was YES. [2024-11-19 05:56:46,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 3896 events. 161/3896 cut-off events. For 546/602 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 29419 event pairs, 24 based on Foata normal form. 12/3701 useless extension candidates. Maximal degree in co-relation 5239. Up to 177 conditions per place. [2024-11-19 05:56:46,669 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 41 selfloop transitions, 5 changer transitions 0/599 dead transitions. [2024-11-19 05:56:46,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 599 transitions, 1724 flow [2024-11-19 05:56:46,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2024-11-19 05:56:46,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9247226624405706 [2024-11-19 05:56:46,671 INFO L175 Difference]: Start difference. First operand has 609 places, 590 transitions, 1603 flow. Second operand 6 states and 3501 transitions. [2024-11-19 05:56:46,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 599 transitions, 1724 flow [2024-11-19 05:56:46,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 599 transitions, 1724 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:46,681 INFO L231 Difference]: Finished difference. Result has 612 places, 588 transitions, 1609 flow [2024-11-19 05:56:46,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1609, PETRI_PLACES=612, PETRI_TRANSITIONS=588} [2024-11-19 05:56:46,682 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 25 predicate places. [2024-11-19 05:56:46,682 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 588 transitions, 1609 flow [2024-11-19 05:56:46,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:46,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:46,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:46,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:56:46,683 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:46,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 593186536, now seen corresponding path program 1 times [2024-11-19 05:56:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:46,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510124837] [2024-11-19 05:56:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:46,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510124837] [2024-11-19 05:56:46,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510124837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:46,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:46,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88925453] [2024-11-19 05:56:46,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:46,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:46,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:46,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:47,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-19 05:56:47,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 588 transitions, 1609 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:47,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:47,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-19 05:56:47,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:47,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][478], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, 319#L104true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 208#L79-4true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 844#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#true, Black: 697#true]) [2024-11-19 05:56:47,843 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-19 05:56:47,843 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-19 05:56:47,843 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-19 05:56:47,843 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-19 05:56:47,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][484], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, 170#L79-5true, 319#L104true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 845#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#true, Black: 697#true]) [2024-11-19 05:56:47,848 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-19 05:56:47,848 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-19 05:56:47,848 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-19 05:56:47,848 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-19 05:56:47,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][490], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 319#L104true, Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, 154#L79-6true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 846#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#true, Black: 697#true]) [2024-11-19 05:56:47,852 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-19 05:56:47,852 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-19 05:56:47,852 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-19 05:56:47,853 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-19 05:56:47,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][495], [130#L79-7true, Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 319#L104true, Black: 832#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 847#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#true, Black: 697#true]) [2024-11-19 05:56:47,856 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-11-19 05:56:47,856 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-19 05:56:47,856 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-19 05:56:47,856 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-19 05:56:47,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][495], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, 319#L104true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 378#L79-8true, 847#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#true, Black: 697#true]) [2024-11-19 05:56:47,859 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-19 05:56:47,859 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-19 05:56:47,859 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-19 05:56:47,859 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-19 05:56:47,990 INFO L124 PetriNetUnfolderBase]: 334/4764 cut-off events. [2024-11-19 05:56:47,990 INFO L125 PetriNetUnfolderBase]: For 884/932 co-relation queries the response was YES. [2024-11-19 05:56:48,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 4764 events. 334/4764 cut-off events. For 884/932 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 40486 event pairs, 40 based on Foata normal form. 8/4500 useless extension candidates. Maximal degree in co-relation 6591. Up to 251 conditions per place. [2024-11-19 05:56:48,054 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 39 selfloop transitions, 5 changer transitions 0/595 dead transitions. [2024-11-19 05:56:48,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 595 transitions, 1720 flow [2024-11-19 05:56:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-19 05:56:48,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9241944004226096 [2024-11-19 05:56:48,056 INFO L175 Difference]: Start difference. First operand has 612 places, 588 transitions, 1609 flow. Second operand 6 states and 3499 transitions. [2024-11-19 05:56:48,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 595 transitions, 1720 flow [2024-11-19 05:56:48,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 595 transitions, 1710 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:48,066 INFO L231 Difference]: Finished difference. Result has 610 places, 586 transitions, 1605 flow [2024-11-19 05:56:48,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1605, PETRI_PLACES=610, PETRI_TRANSITIONS=586} [2024-11-19 05:56:48,067 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 23 predicate places. [2024-11-19 05:56:48,067 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 586 transitions, 1605 flow [2024-11-19 05:56:48,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:48,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:48,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:48,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:56:48,068 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -752309935, now seen corresponding path program 1 times [2024-11-19 05:56:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118536031] [2024-11-19 05:56:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118536031] [2024-11-19 05:56:48,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118536031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:48,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:48,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353847142] [2024-11-19 05:56:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:48,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:48,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:48,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:48,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:48,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-19 05:56:48,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 586 transitions, 1605 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:48,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:48,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-19 05:56:48,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:49,208 INFO L124 PetriNetUnfolderBase]: 195/4259 cut-off events. [2024-11-19 05:56:49,209 INFO L125 PetriNetUnfolderBase]: For 629/721 co-relation queries the response was YES. [2024-11-19 05:56:49,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5896 conditions, 4259 events. 195/4259 cut-off events. For 629/721 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 33666 event pairs, 29 based on Foata normal form. 7/4060 useless extension candidates. Maximal degree in co-relation 5804. Up to 196 conditions per place. [2024-11-19 05:56:49,271 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 40 selfloop transitions, 5 changer transitions 0/594 dead transitions. [2024-11-19 05:56:49,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 594 transitions, 1721 flow [2024-11-19 05:56:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2024-11-19 05:56:49,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9244585314315901 [2024-11-19 05:56:49,274 INFO L175 Difference]: Start difference. First operand has 610 places, 586 transitions, 1605 flow. Second operand 6 states and 3500 transitions. [2024-11-19 05:56:49,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 594 transitions, 1721 flow [2024-11-19 05:56:49,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 594 transitions, 1711 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:49,283 INFO L231 Difference]: Finished difference. Result has 608 places, 584 transitions, 1601 flow [2024-11-19 05:56:49,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1601, PETRI_PLACES=608, PETRI_TRANSITIONS=584} [2024-11-19 05:56:49,284 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 21 predicate places. [2024-11-19 05:56:49,284 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 584 transitions, 1601 flow [2024-11-19 05:56:49,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:49,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:49,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:49,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:56:49,285 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:49,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash -575778182, now seen corresponding path program 1 times [2024-11-19 05:56:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319654719] [2024-11-19 05:56:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319654719] [2024-11-19 05:56:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319654719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483397413] [2024-11-19 05:56:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:49,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:49,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 631 [2024-11-19 05:56:49,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 584 transitions, 1601 flow. Second operand has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:49,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:49,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 631 [2024-11-19 05:56:49,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:49,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1753] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][331], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 655#true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 461#L105true, 657#(= |#race~a1~0| 0), 848#true, Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 697#true, 854#true]) [2024-11-19 05:56:49,800 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-19 05:56:49,800 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-19 05:56:49,800 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:56:49,800 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:56:49,853 INFO L124 PetriNetUnfolderBase]: 130/4207 cut-off events. [2024-11-19 05:56:49,853 INFO L125 PetriNetUnfolderBase]: For 517/559 co-relation queries the response was YES. [2024-11-19 05:56:49,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5600 conditions, 4207 events. 130/4207 cut-off events. For 517/559 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 31557 event pairs, 22 based on Foata normal form. 0/4036 useless extension candidates. Maximal degree in co-relation 5509. Up to 124 conditions per place. [2024-11-19 05:56:49,904 INFO L140 encePairwiseOnDemand]: 629/631 looper letters, 9 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2024-11-19 05:56:49,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 583 transitions, 1619 flow [2024-11-19 05:56:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2024-11-19 05:56:49,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9550977284733227 [2024-11-19 05:56:49,905 INFO L175 Difference]: Start difference. First operand has 608 places, 584 transitions, 1601 flow. Second operand 3 states and 1808 transitions. [2024-11-19 05:56:49,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 583 transitions, 1619 flow [2024-11-19 05:56:49,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 583 transitions, 1609 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:49,914 INFO L231 Difference]: Finished difference. Result has 604 places, 583 transitions, 1591 flow [2024-11-19 05:56:49,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1591, PETRI_PLACES=604, PETRI_TRANSITIONS=583} [2024-11-19 05:56:49,915 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 17 predicate places. [2024-11-19 05:56:49,915 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 583 transitions, 1591 flow [2024-11-19 05:56:49,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:49,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:49,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:49,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:56:49,916 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1347222258, now seen corresponding path program 1 times [2024-11-19 05:56:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493073521] [2024-11-19 05:56:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:49,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493073521] [2024-11-19 05:56:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493073521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241452897] [2024-11-19 05:56:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:50,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:50,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-19 05:56:50,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 583 transitions, 1591 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:50,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:50,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-19 05:56:50,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:51,143 INFO L124 PetriNetUnfolderBase]: 220/4123 cut-off events. [2024-11-19 05:56:51,143 INFO L125 PetriNetUnfolderBase]: For 732/761 co-relation queries the response was YES. [2024-11-19 05:56:51,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 4123 events. 220/4123 cut-off events. For 732/761 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 32658 event pairs, 32 based on Foata normal form. 0/3979 useless extension candidates. Maximal degree in co-relation 5656. Up to 204 conditions per place. [2024-11-19 05:56:51,196 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 39 selfloop transitions, 5 changer transitions 0/590 dead transitions. [2024-11-19 05:56:51,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 590 transitions, 1702 flow [2024-11-19 05:56:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-19 05:56:51,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9241944004226096 [2024-11-19 05:56:51,198 INFO L175 Difference]: Start difference. First operand has 604 places, 583 transitions, 1591 flow. Second operand 6 states and 3499 transitions. [2024-11-19 05:56:51,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 590 transitions, 1702 flow [2024-11-19 05:56:51,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 590 transitions, 1701 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:51,208 INFO L231 Difference]: Finished difference. Result has 606 places, 581 transitions, 1596 flow [2024-11-19 05:56:51,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1596, PETRI_PLACES=606, PETRI_TRANSITIONS=581} [2024-11-19 05:56:51,209 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 19 predicate places. [2024-11-19 05:56:51,209 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 581 transitions, 1596 flow [2024-11-19 05:56:51,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:51,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:51,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:51,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:56:51,210 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:51,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash -943953569, now seen corresponding path program 1 times [2024-11-19 05:56:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878323409] [2024-11-19 05:56:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878323409] [2024-11-19 05:56:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878323409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940434943] [2024-11-19 05:56:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:51,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:51,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:51,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 581 transitions, 1596 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:51,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:51,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:51,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:51,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1753] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][331], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 655#true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), 461#L105true, Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 863#true, Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 697#true, 857#true]) [2024-11-19 05:56:51,712 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-19 05:56:51,712 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-19 05:56:51,712 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:56:51,712 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:56:51,770 INFO L124 PetriNetUnfolderBase]: 120/3723 cut-off events. [2024-11-19 05:56:51,770 INFO L125 PetriNetUnfolderBase]: For 431/497 co-relation queries the response was YES. [2024-11-19 05:56:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5029 conditions, 3723 events. 120/3723 cut-off events. For 431/497 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 26178 event pairs, 27 based on Foata normal form. 0/3615 useless extension candidates. Maximal degree in co-relation 4938. Up to 133 conditions per place. [2024-11-19 05:56:51,817 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 11 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2024-11-19 05:56:51,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 579 transitions, 1616 flow [2024-11-19 05:56:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2024-11-19 05:56:51,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9519281563655573 [2024-11-19 05:56:51,818 INFO L175 Difference]: Start difference. First operand has 606 places, 581 transitions, 1596 flow. Second operand 3 states and 1802 transitions. [2024-11-19 05:56:51,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 579 transitions, 1616 flow [2024-11-19 05:56:51,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 579 transitions, 1606 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:51,827 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1584 flow [2024-11-19 05:56:51,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2024-11-19 05:56:51,827 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2024-11-19 05:56:51,827 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1584 flow [2024-11-19 05:56:51,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:51,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:51,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:51,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:56:51,828 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:51,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1383982660, now seen corresponding path program 1 times [2024-11-19 05:56:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:51,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212591286] [2024-11-19 05:56:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212591286] [2024-11-19 05:56:51,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212591286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:51,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:51,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925484408] [2024-11-19 05:56:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:51,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:51,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:51,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:51,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:51,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:51,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:51,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:52,296 INFO L124 PetriNetUnfolderBase]: 120/3068 cut-off events. [2024-11-19 05:56:52,296 INFO L125 PetriNetUnfolderBase]: For 339/379 co-relation queries the response was YES. [2024-11-19 05:56:52,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 3068 events. 120/3068 cut-off events. For 339/379 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 20731 event pairs, 33 based on Foata normal form. 15/3009 useless extension candidates. Maximal degree in co-relation 4019. Up to 144 conditions per place. [2024-11-19 05:56:52,328 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 7 selfloop transitions, 0 changer transitions 24/577 dead transitions. [2024-11-19 05:56:52,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 577 transitions, 1602 flow [2024-11-19 05:56:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-19 05:56:52,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-19 05:56:52,330 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1584 flow. Second operand 3 states and 1801 transitions. [2024-11-19 05:56:52,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 577 transitions, 1602 flow [2024-11-19 05:56:52,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 577 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:52,337 INFO L231 Difference]: Finished difference. Result has 600 places, 553 transitions, 1474 flow [2024-11-19 05:56:52,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=600, PETRI_TRANSITIONS=553} [2024-11-19 05:56:52,338 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, 13 predicate places. [2024-11-19 05:56:52,338 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 553 transitions, 1474 flow [2024-11-19 05:56:52,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:52,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:52,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:52,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 05:56:52,338 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1778557083, now seen corresponding path program 1 times [2024-11-19 05:56:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896735824] [2024-11-19 05:56:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896735824] [2024-11-19 05:56:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896735824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:52,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516794051] [2024-11-19 05:56:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:52,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:52,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 631 [2024-11-19 05:56:52,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 553 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:52,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:52,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 631 [2024-11-19 05:56:52,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:52,866 INFO L124 PetriNetUnfolderBase]: 140/3562 cut-off events. [2024-11-19 05:56:52,866 INFO L125 PetriNetUnfolderBase]: For 330/350 co-relation queries the response was YES. [2024-11-19 05:56:52,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 3562 events. 140/3562 cut-off events. For 330/350 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 23872 event pairs, 20 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4672. Up to 93 conditions per place. [2024-11-19 05:56:52,911 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 10 selfloop transitions, 2 changer transitions 12/554 dead transitions. [2024-11-19 05:56:52,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 554 transitions, 1502 flow [2024-11-19 05:56:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-19 05:56:52,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-19 05:56:52,912 INFO L175 Difference]: Start difference. First operand has 600 places, 553 transitions, 1474 flow. Second operand 3 states and 1804 transitions. [2024-11-19 05:56:52,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 554 transitions, 1502 flow [2024-11-19 05:56:52,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 554 transitions, 1490 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:52,921 INFO L231 Difference]: Finished difference. Result has 580 places, 540 transitions, 1382 flow [2024-11-19 05:56:52,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1382, PETRI_PLACES=580, PETRI_TRANSITIONS=540} [2024-11-19 05:56:52,926 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -7 predicate places. [2024-11-19 05:56:52,926 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 540 transitions, 1382 flow [2024-11-19 05:56:52,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:52,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:52,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:52,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 05:56:52,930 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1554249013, now seen corresponding path program 1 times [2024-11-19 05:56:52,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:52,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187329789] [2024-11-19 05:56:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187329789] [2024-11-19 05:56:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187329789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:52,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:52,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579044122] [2024-11-19 05:56:52,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:52,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:52,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:53,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:53,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 540 transitions, 1382 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:53,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:53,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:53,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:53,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1441] L51-8-->L51-9: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][375], [Black: 754#(<= ~n2~0 0), 308#L51-9true, Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 832#true, Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 869#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 51#L102-4true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 866#true, 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 586#L65-1true, 657#(= |#race~a1~0| 0), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), 179#L79-1true, 872#true, Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 697#true]) [2024-11-19 05:56:53,357 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-19 05:56:53,357 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-19 05:56:53,357 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-19 05:56:53,357 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-19 05:56:53,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][351], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 319#L104true, Black: 832#true, Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 869#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 655#true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 866#true, 834#(= |#race~a3~0| 0), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 657#(= |#race~a1~0| 0), Black: 816#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 179#L79-1true, 872#true, Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 697#true]) [2024-11-19 05:56:53,395 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-19 05:56:53,395 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-19 05:56:53,395 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-19 05:56:53,395 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-19 05:56:53,401 INFO L124 PetriNetUnfolderBase]: 135/2905 cut-off events. [2024-11-19 05:56:53,401 INFO L125 PetriNetUnfolderBase]: For 200/223 co-relation queries the response was YES. [2024-11-19 05:56:53,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 2905 events. 135/2905 cut-off events. For 200/223 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18460 event pairs, 27 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 3718. Up to 90 conditions per place. [2024-11-19 05:56:53,443 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 10 selfloop transitions, 2 changer transitions 11/541 dead transitions. [2024-11-19 05:56:53,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 541 transitions, 1410 flow [2024-11-19 05:56:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-19 05:56:53,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-19 05:56:53,445 INFO L175 Difference]: Start difference. First operand has 580 places, 540 transitions, 1382 flow. Second operand 3 states and 1801 transitions. [2024-11-19 05:56:53,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 541 transitions, 1410 flow [2024-11-19 05:56:53,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 541 transitions, 1364 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-11-19 05:56:53,452 INFO L231 Difference]: Finished difference. Result has 561 places, 528 transitions, 1266 flow [2024-11-19 05:56:53,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=561, PETRI_TRANSITIONS=528} [2024-11-19 05:56:53,453 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -26 predicate places. [2024-11-19 05:56:53,453 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 528 transitions, 1266 flow [2024-11-19 05:56:53,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:53,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:53,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:53,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 05:56:53,454 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-19 05:56:53,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1386353249, now seen corresponding path program 1 times [2024-11-19 05:56:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:53,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915843812] [2024-11-19 05:56:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915843812] [2024-11-19 05:56:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915843812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794454212] [2024-11-19 05:56:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:53,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:53,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:53,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-19 05:56:53,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 528 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:53,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:53,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-19 05:56:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:53,749 INFO L124 PetriNetUnfolderBase]: 107/1753 cut-off events. [2024-11-19 05:56:53,749 INFO L125 PetriNetUnfolderBase]: For 69/91 co-relation queries the response was YES. [2024-11-19 05:56:53,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1753 events. 107/1753 cut-off events. For 69/91 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9603 event pairs, 21 based on Foata normal form. 1/1680 useless extension candidates. Maximal degree in co-relation 2177. Up to 71 conditions per place. [2024-11-19 05:56:53,770 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 0 selfloop transitions, 0 changer transitions 529/529 dead transitions. [2024-11-19 05:56:53,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 529 transitions, 1294 flow [2024-11-19 05:56:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-19 05:56:53,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-19 05:56:53,772 INFO L175 Difference]: Start difference. First operand has 561 places, 528 transitions, 1266 flow. Second operand 3 states and 1801 transitions. [2024-11-19 05:56:53,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 529 transitions, 1294 flow [2024-11-19 05:56:53,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 529 transitions, 1252 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-19 05:56:53,776 INFO L231 Difference]: Finished difference. Result has 542 places, 0 transitions, 0 flow [2024-11-19 05:56:53,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=631, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=542, PETRI_TRANSITIONS=0} [2024-11-19 05:56:53,776 INFO L277 CegarLoopForPetriNet]: 587 programPoint places, -45 predicate places. [2024-11-19 05:56:53,776 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 0 transitions, 0 flow [2024-11-19 05:56:53,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:53,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (103 of 104 remaining) [2024-11-19 05:56:53,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2024-11-19 05:56:53,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2024-11-19 05:56:53,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2024-11-19 05:56:53,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2024-11-19 05:56:53,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2024-11-19 05:56:53,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2024-11-19 05:56:53,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2024-11-19 05:56:53,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2024-11-19 05:56:53,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2024-11-19 05:56:53,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2024-11-19 05:56:53,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2024-11-19 05:56:53,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2024-11-19 05:56:53,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2024-11-19 05:56:53,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (50 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (49 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (48 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (47 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (46 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (45 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2024-11-19 05:56:53,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2024-11-19 05:56:53,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2024-11-19 05:56:53,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2024-11-19 05:56:53,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2024-11-19 05:56:53,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2024-11-19 05:56:53,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2024-11-19 05:56:53,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2024-11-19 05:56:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 05:56:53,789 INFO L407 BasicCegarLoop]: Path program 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-11-19 05:56:53,796 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:56:53,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:56:53,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:56:53 BasicIcfg [2024-11-19 05:56:53,800 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:56:53,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:56:53,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:56:53,801 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:56:53,801 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:18" (3/4) ... [2024-11-19 05:56:53,802 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:56:53,805 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:56:53,805 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:56:53,805 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:56:53,809 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-19 05:56:53,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:56:53,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:56:53,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:56:53,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:56:53,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:56:53,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:56:53,896 INFO L158 Benchmark]: Toolchain (without parser) took 37104.26ms. Allocated memory was 142.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 70.6MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-19 05:56:53,897 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:56:53,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.67ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 112.8MB in the end (delta: -42.4MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.96ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 112.8MB in the beginning and 169.8MB in the end (delta: -57.0MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,897 INFO L158 Benchmark]: Boogie Preprocessor took 53.57ms. Allocated memory is still 201.3MB. Free memory was 169.8MB in the beginning and 166.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,897 INFO L158 Benchmark]: RCFGBuilder took 835.18ms. Allocated memory is still 201.3MB. Free memory was 166.6MB in the beginning and 118.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,897 INFO L158 Benchmark]: TraceAbstraction took 35734.19ms. Allocated memory was 201.3MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 117.3MB in the beginning and 5.9GB in the end (delta: -5.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-11-19 05:56:53,897 INFO L158 Benchmark]: Witness Printer took 95.43ms. Allocated memory is still 7.8GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,898 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.67ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 112.8MB in the end (delta: -42.4MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.96ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 112.8MB in the beginning and 169.8MB in the end (delta: -57.0MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.57ms. Allocated memory is still 201.3MB. Free memory was 169.8MB in the beginning and 166.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 835.18ms. Allocated memory is still 201.3MB. Free memory was 166.6MB in the beginning and 118.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35734.19ms. Allocated memory was 201.3MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 117.3MB in the beginning and 5.9GB in the end (delta: -5.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 95.43ms. Allocated memory is still 7.8GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 932 locations, 104 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.6s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6673 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4306 mSDsluCounter, 6620 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6341 mSDsCounter, 1289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10630 IncrementalHoareTripleChecker+Invalid, 11919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1289 mSolverCounterUnsat, 279 mSDtfsCounter, 10630 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1626occurred in iteration=24, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 6303 NumberOfCodeBlocks, 6303 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6266 ConstructedInterpolants, 0 QuantifiedInterpolants, 8598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 59 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:56:53,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE