./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:36:03,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:36:03,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:36:03,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:36:03,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:36:03,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:36:03,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:36:03,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:36:03,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:36:03,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:36:03,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:36:03,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:36:03,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:36:03,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:36:03,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:36:03,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:36:03,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:36:03,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:36:03,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:36:03,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:36:03,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:36:03,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:36:03,293 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:36:03,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:36:03,294 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:36:03,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:36:03,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:36:03,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:36:03,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:36:03,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:36:03,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:36:03,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:36:03,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:36:03,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:36:03,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:36:03,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:36:03,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:36:03,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:36:03,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:36:03,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:36:03,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:36:03,300 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-12 12:36:03,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:36:03,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:36:03,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:36:03,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:36:03,630 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:36:03,631 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-12 12:36:05,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:36:05,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:36:05,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2024-11-12 12:36:05,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190cb8719/cb7886b325b14134b7308dc9e9edefdb/FLAG4886bbc77 [2024-11-12 12:36:05,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190cb8719/cb7886b325b14134b7308dc9e9edefdb [2024-11-12 12:36:05,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:36:05,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:36:05,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:36:05,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:36:05,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:36:05,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e2f668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05, skipping insertion in model container [2024-11-12 12:36:05,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:36:05,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:36:05,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:36:05,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:36:05,783 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:36:05,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05 WrapperNode [2024-11-12 12:36:05,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:36:05,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:36:05,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:36:05,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:36:05,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,857 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 488 [2024-11-12 12:36:05,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:36:05,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:36:05,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:36:05,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:36:05,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:36:05,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:36:05,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:36:05,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:36:05,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (1/1) ... [2024-11-12 12:36:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:36:05,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:36:05,973 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-12 12:36:05,976 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-12 12:36:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:36:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:36:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:36:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:36:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:36:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 12:36:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 12:36:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:36:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:36:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:36:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:36:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:36:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:36:06,024 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:36:06,147 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:36:06,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:36:06,902 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:36:06,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:36:06,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:36:06,925 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 12:36:06,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:36:06 BoogieIcfgContainer [2024-11-12 12:36:06,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:36:06,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:36:06,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:36:06,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:36:06,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:36:05" (1/3) ... [2024-11-12 12:36:06,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e06e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:36:06, skipping insertion in model container [2024-11-12 12:36:06,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:36:05" (2/3) ... [2024-11-12 12:36:06,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e06e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:36:06, skipping insertion in model container [2024-11-12 12:36:06,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:36:06" (3/3) ... [2024-11-12 12:36:06,934 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2024-11-12 12:36:06,950 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:36:06,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-12 12:36:06,950 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:36:07,180 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:36:07,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 608 places, 631 transitions, 1283 flow [2024-11-12 12:36:07,523 INFO L124 PetriNetUnfolderBase]: 33/628 cut-off events. [2024-11-12 12:36:07,523 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:36:07,546 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-12 12:36:07,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 608 places, 631 transitions, 1283 flow [2024-11-12 12:36:07,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 608 transitions, 1234 flow [2024-11-12 12:36:07,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:36:07,580 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;@1cefd814, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:36:07,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-12 12:36:07,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:36:07,586 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-12 12:36:07,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:36:07,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:07,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:07,588 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-12 12:36:07,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash -447807204, now seen corresponding path program 1 times [2024-11-12 12:36:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027181907] [2024-11-12 12:36:07,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:07,810 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-12 12:36:07,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:07,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027181907] [2024-11-12 12:36:07,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027181907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114916281] [2024-11-12 12:36:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:07,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:07,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-12 12:36:07,921 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-12 12:36:07,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:07,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-12 12:36:07,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:08,356 INFO L124 PetriNetUnfolderBase]: 56/1488 cut-off events. [2024-11-12 12:36:08,357 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-12 12:36:08,374 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-12 12:36:08,386 INFO L140 encePairwiseOnDemand]: 609/631 looper letters, 14 selfloop transitions, 2 changer transitions 7/588 dead transitions. [2024-11-12 12:36:08,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 588 transitions, 1226 flow [2024-11-12 12:36:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2024-11-12 12:36:08,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572107765451664 [2024-11-12 12:36:08,413 INFO L175 Difference]: Start difference. First operand has 587 places, 608 transitions, 1234 flow. Second operand 3 states and 1812 transitions. [2024-11-12 12:36:08,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 588 transitions, 1226 flow [2024-11-12 12:36:08,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 588 transitions, 1214 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-12 12:36:08,436 INFO L231 Difference]: Finished difference. Result has 582 places, 581 transitions, 1172 flow [2024-11-12 12:36:08,440 INFO L262 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-12 12:36:08,445 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2024-11-12 12:36:08,446 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 581 transitions, 1172 flow [2024-11-12 12:36:08,447 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-12 12:36:08,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:08,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:08,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:36:08,448 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-12 12:36:08,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 929963280, now seen corresponding path program 1 times [2024-11-12 12:36:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:08,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625688790] [2024-11-12 12:36:08,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:08,537 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-12 12:36:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625688790] [2024-11-12 12:36:08,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625688790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:08,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611771906] [2024-11-12 12:36:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:08,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:08,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:08,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-12 12:36:08,599 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-12 12:36:08,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:08,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-12 12:36:08,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:08,825 INFO L124 PetriNetUnfolderBase]: 36/1024 cut-off events. [2024-11-12 12:36:08,825 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:36:08,841 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-12 12:36:08,850 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 14 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-12 12:36:08,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2024-11-12 12:36:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-12 12:36:08,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471737982039091 [2024-11-12 12:36:08,855 INFO L175 Difference]: Start difference. First operand has 582 places, 581 transitions, 1172 flow. Second operand 3 states and 1793 transitions. [2024-11-12 12:36:08,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2024-11-12 12:36:08,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:08,866 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1170 flow [2024-11-12 12:36:08,867 INFO L262 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-12 12:36:08,868 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2024-11-12 12:36:08,868 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1170 flow [2024-11-12 12:36:08,870 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-12 12:36:08,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:08,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:08,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:36:08,871 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-12 12:36:08,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 32050057, now seen corresponding path program 1 times [2024-11-12 12:36:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883127973] [2024-11-12 12:36:08,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:08,945 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-12 12:36:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883127973] [2024-11-12 12:36:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883127973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279594621] [2024-11-12 12:36:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:08,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:08,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:08,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:08,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 631 [2024-11-12 12:36:08,988 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-12 12:36:08,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:08,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 631 [2024-11-12 12:36:08,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:09,363 INFO L124 PetriNetUnfolderBase]: 56/1455 cut-off events. [2024-11-12 12:36:09,363 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-11-12 12:36:09,385 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-12 12:36:09,403 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2024-11-12 12:36:09,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1200 flow [2024-11-12 12:36:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-12 12:36:09,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471737982039091 [2024-11-12 12:36:09,408 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1170 flow. Second operand 3 states and 1793 transitions. [2024-11-12 12:36:09,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1200 flow [2024-11-12 12:36:09,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:09,417 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1168 flow [2024-11-12 12:36:09,419 INFO L262 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-12 12:36:09,420 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -14 predicate places. [2024-11-12 12:36:09,421 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1168 flow [2024-11-12 12:36:09,422 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-12 12:36:09,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:09,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:09,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:36:09,423 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-12 12:36:09,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1975053910, now seen corresponding path program 1 times [2024-11-12 12:36:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:09,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479264237] [2024-11-12 12:36:09,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:09,486 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-12 12:36:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479264237] [2024-11-12 12:36:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479264237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542462303] [2024-11-12 12:36:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:09,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-12 12:36:09,512 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-12 12:36:09,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:09,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-12 12:36:09,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:10,062 INFO L124 PetriNetUnfolderBase]: 132/2496 cut-off events. [2024-11-12 12:36:10,063 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:36:10,092 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-12 12:36:10,107 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2024-11-12 12:36:10,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1192 flow [2024-11-12 12:36:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-12 12:36:10,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-12 12:36:10,112 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1168 flow. Second operand 3 states and 1786 transitions. [2024-11-12 12:36:10,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1192 flow [2024-11-12 12:36:10,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:10,122 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2024-11-12 12:36:10,123 INFO L262 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-12 12:36:10,125 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2024-11-12 12:36:10,125 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2024-11-12 12:36:10,126 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-12 12:36:10,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:10,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:10,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:36:10,127 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-12 12:36:10,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1023932628, now seen corresponding path program 1 times [2024-11-12 12:36:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850699009] [2024-11-12 12:36:10,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:10,732 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-12 12:36:10,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:10,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850699009] [2024-11-12 12:36:10,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850699009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:10,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:10,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273377767] [2024-11-12 12:36:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:10,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:11,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 631 [2024-11-12 12:36:11,326 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-12 12:36:11,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:11,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 631 [2024-11-12 12:36:11,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:20,701 INFO L124 PetriNetUnfolderBase]: 12107/56176 cut-off events. [2024-11-12 12:36:20,701 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-12 12:36:20,975 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-12 12:36:21,293 INFO L140 encePairwiseOnDemand]: 613/631 looper letters, 78 selfloop transitions, 15 changer transitions 0/571 dead transitions. [2024-11-12 12:36:21,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 571 transitions, 1336 flow [2024-11-12 12:36:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3180 transitions. [2024-11-12 12:36:21,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8399366085578447 [2024-11-12 12:36:21,302 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 6 states and 3180 transitions. [2024-11-12 12:36:21,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 571 transitions, 1336 flow [2024-11-12 12:36:21,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 571 transitions, 1335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:21,314 INFO L231 Difference]: Finished difference. Result has 569 places, 571 transitions, 1179 flow [2024-11-12 12:36:21,315 INFO L262 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-12 12:36:21,318 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2024-11-12 12:36:21,318 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 571 transitions, 1179 flow [2024-11-12 12:36:21,321 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-12 12:36:21,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:21,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:21,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:36:21,322 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-12 12:36:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1772920805, now seen corresponding path program 1 times [2024-11-12 12:36:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813764881] [2024-11-12 12:36:21,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:21,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:21,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-12 12:36:21,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813764881] [2024-11-12 12:36:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813764881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:21,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632997819] [2024-11-12 12:36:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:21,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:21,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-12 12:36:21,562 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-12 12:36:21,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:21,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-12 12:36:21,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:21,785 INFO L124 PetriNetUnfolderBase]: 62/1744 cut-off events. [2024-11-12 12:36:21,785 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-12 12:36:21,801 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-12 12:36:21,810 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2024-11-12 12:36:21,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 570 transitions, 1207 flow [2024-11-12 12:36:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-12 12:36:21,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-12 12:36:21,815 INFO L175 Difference]: Start difference. First operand has 569 places, 571 transitions, 1179 flow. Second operand 3 states and 1795 transitions. [2024-11-12 12:36:21,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 570 transitions, 1207 flow [2024-11-12 12:36:21,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 570 transitions, 1177 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:21,825 INFO L231 Difference]: Finished difference. Result has 565 places, 570 transitions, 1151 flow [2024-11-12 12:36:21,826 INFO L262 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-12 12:36:21,827 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -22 predicate places. [2024-11-12 12:36:21,827 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 570 transitions, 1151 flow [2024-11-12 12:36:21,828 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-12 12:36:21,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:21,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:21,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:36:21,829 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-12 12:36:21,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2097705736, now seen corresponding path program 1 times [2024-11-12 12:36:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296488738] [2024-11-12 12:36:21,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:21,863 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-12 12:36:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296488738] [2024-11-12 12:36:21,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296488738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:21,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:21,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362679939] [2024-11-12 12:36:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:21,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:21,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:21,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:21,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-12 12:36:21,887 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-12 12:36:21,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:21,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-12 12:36:21,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:22,195 INFO L124 PetriNetUnfolderBase]: 78/1635 cut-off events. [2024-11-12 12:36:22,196 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-12 12:36:22,242 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-12 12:36:22,256 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2024-11-12 12:36:22,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 565 transitions, 1175 flow [2024-11-12 12:36:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-12 12:36:22,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-12 12:36:22,264 INFO L175 Difference]: Start difference. First operand has 565 places, 570 transitions, 1151 flow. Second operand 3 states and 1786 transitions. [2024-11-12 12:36:22,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 565 transitions, 1175 flow [2024-11-12 12:36:22,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 565 transitions, 1171 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:22,273 INFO L231 Difference]: Finished difference. Result has 560 places, 565 transitions, 1139 flow [2024-11-12 12:36:22,275 INFO L262 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-12 12:36:22,275 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2024-11-12 12:36:22,276 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 565 transitions, 1139 flow [2024-11-12 12:36:22,278 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-12 12:36:22,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:22,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:22,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:36:22,279 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-12 12:36:22,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash -531904196, now seen corresponding path program 1 times [2024-11-12 12:36:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:22,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149795967] [2024-11-12 12:36:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:22,354 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-12 12:36:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149795967] [2024-11-12 12:36:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149795967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:22,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:22,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52086776] [2024-11-12 12:36:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:22,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:22,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-12 12:36:22,387 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-12 12:36:22,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:22,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-12 12:36:22,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:22,592 INFO L124 PetriNetUnfolderBase]: 36/1038 cut-off events. [2024-11-12 12:36:22,593 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-12 12:36:22,606 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-12 12:36:22,610 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2024-11-12 12:36:22,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 564 transitions, 1167 flow [2024-11-12 12:36:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-12 12:36:22,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-12 12:36:22,616 INFO L175 Difference]: Start difference. First operand has 560 places, 565 transitions, 1139 flow. Second operand 3 states and 1795 transitions. [2024-11-12 12:36:22,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 564 transitions, 1167 flow [2024-11-12 12:36:22,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 564 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:22,626 INFO L231 Difference]: Finished difference. Result has 560 places, 564 transitions, 1140 flow [2024-11-12 12:36:22,627 INFO L262 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-12 12:36:22,627 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2024-11-12 12:36:22,628 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 564 transitions, 1140 flow [2024-11-12 12:36:22,629 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-12 12:36:22,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:22,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:36:22,630 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-12 12:36:22,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash -652471666, now seen corresponding path program 1 times [2024-11-12 12:36:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:22,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425397419] [2024-11-12 12:36:22,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:22,691 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-12 12:36:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425397419] [2024-11-12 12:36:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425397419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795540347] [2024-11-12 12:36:22,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:22,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 631 [2024-11-12 12:36:22,719 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-12 12:36:22,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:22,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 631 [2024-11-12 12:36:22,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:23,142 INFO L124 PetriNetUnfolderBase]: 136/2442 cut-off events. [2024-11-12 12:36:23,142 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2024-11-12 12:36:23,175 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-12 12:36:23,190 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 16 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2024-11-12 12:36:23,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 559 transitions, 1164 flow [2024-11-12 12:36:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2024-11-12 12:36:23,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434759640781828 [2024-11-12 12:36:23,194 INFO L175 Difference]: Start difference. First operand has 560 places, 564 transitions, 1140 flow. Second operand 3 states and 1786 transitions. [2024-11-12 12:36:23,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 559 transitions, 1164 flow [2024-11-12 12:36:23,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 559 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:23,203 INFO L231 Difference]: Finished difference. Result has 555 places, 559 transitions, 1128 flow [2024-11-12 12:36:23,204 INFO L262 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-12 12:36:23,205 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-12 12:36:23,205 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 559 transitions, 1128 flow [2024-11-12 12:36:23,207 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-12 12:36:23,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:23,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:23,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:36:23,207 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-12 12:36:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1387397697, now seen corresponding path program 1 times [2024-11-12 12:36:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:23,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599346397] [2024-11-12 12:36:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:23,261 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-12 12:36:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599346397] [2024-11-12 12:36:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599346397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:23,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374331772] [2024-11-12 12:36:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:23,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:23,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 631 [2024-11-12 12:36:23,294 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-12 12:36:23,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:23,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 631 [2024-11-12 12:36:23,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:23,470 INFO L124 PetriNetUnfolderBase]: 38/810 cut-off events. [2024-11-12 12:36:23,470 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-12 12:36:23,477 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-12 12:36:23,480 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-12 12:36:23,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1156 flow [2024-11-12 12:36:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-12 12:36:23,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948230322239831 [2024-11-12 12:36:23,485 INFO L175 Difference]: Start difference. First operand has 555 places, 559 transitions, 1128 flow. Second operand 3 states and 1795 transitions. [2024-11-12 12:36:23,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1156 flow [2024-11-12 12:36:23,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:23,493 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1129 flow [2024-11-12 12:36:23,494 INFO L262 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-12 12:36:23,495 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-12 12:36:23,495 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1129 flow [2024-11-12 12:36:23,497 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-12 12:36:23,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:23,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:23,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:36:23,497 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-12 12:36:23,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1341973257, now seen corresponding path program 1 times [2024-11-12 12:36:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706472159] [2024-11-12 12:36:23,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:23,555 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-12 12:36:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706472159] [2024-11-12 12:36:23,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706472159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:23,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:23,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:23,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884507772] [2024-11-12 12:36:23,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:23,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:23,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:23,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 631 [2024-11-12 12:36:23,575 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-12 12:36:23,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:23,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 631 [2024-11-12 12:36:23,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:23,723 INFO L124 PetriNetUnfolderBase]: 34/990 cut-off events. [2024-11-12 12:36:23,724 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:36:23,734 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-12 12:36:23,739 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 12 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-12 12:36:23,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 559 transitions, 1161 flow [2024-11-12 12:36:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-12 12:36:23,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-12 12:36:23,744 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1129 flow. Second operand 3 states and 1806 transitions. [2024-11-12 12:36:23,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 559 transitions, 1161 flow [2024-11-12 12:36:23,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 559 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:23,752 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1127 flow [2024-11-12 12:36:23,753 INFO L262 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-12 12:36:23,754 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2024-11-12 12:36:23,754 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1127 flow [2024-11-12 12:36:23,755 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-12 12:36:23,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:23,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:23,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:36:23,756 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-12 12:36:23,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2126152066, now seen corresponding path program 1 times [2024-11-12 12:36:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156036633] [2024-11-12 12:36:23,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:23,813 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-12 12:36:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156036633] [2024-11-12 12:36:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156036633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:23,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677187691] [2024-11-12 12:36:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:23,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:23,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:23,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:23,834 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-12 12:36:23,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:23,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:23,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:23,976 INFO L124 PetriNetUnfolderBase]: 31/876 cut-off events. [2024-11-12 12:36:23,976 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-12 12:36:23,989 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-12 12:36:23,994 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-12 12:36:23,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 558 transitions, 1161 flow [2024-11-12 12:36:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-12 12:36:23,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-12 12:36:23,999 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1127 flow. Second operand 3 states and 1804 transitions. [2024-11-12 12:36:23,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 558 transitions, 1161 flow [2024-11-12 12:36:24,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:24,009 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1125 flow [2024-11-12 12:36:24,010 INFO L262 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-12 12:36:24,011 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2024-11-12 12:36:24,012 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1125 flow [2024-11-12 12:36:24,013 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-12 12:36:24,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:24,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:36:24,013 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-12 12:36:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1305878310, now seen corresponding path program 1 times [2024-11-12 12:36:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812073296] [2024-11-12 12:36:24,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:24,068 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-12 12:36:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812073296] [2024-11-12 12:36:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812073296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:36:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020913415] [2024-11-12 12:36:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:24,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:24,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:24,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:24,084 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-12 12:36:24,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:24,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:24,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:24,235 INFO L124 PetriNetUnfolderBase]: 40/991 cut-off events. [2024-11-12 12:36:24,235 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-11-12 12:36:24,249 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-12 12:36:24,254 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2024-11-12 12:36:24,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 559 transitions, 1167 flow [2024-11-12 12:36:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-12 12:36:24,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-12 12:36:24,259 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1125 flow. Second operand 3 states and 1806 transitions. [2024-11-12 12:36:24,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 559 transitions, 1167 flow [2024-11-12 12:36:24,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 559 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:24,270 INFO L231 Difference]: Finished difference. Result has 555 places, 557 transitions, 1139 flow [2024-11-12 12:36:24,272 INFO L262 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-12 12:36:24,273 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2024-11-12 12:36:24,273 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 557 transitions, 1139 flow [2024-11-12 12:36:24,274 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-12 12:36:24,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:24,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:36:24,274 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-12 12:36:24,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash 327144343, now seen corresponding path program 1 times [2024-11-12 12:36:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106135184] [2024-11-12 12:36:24,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:24,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:24,329 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-12 12:36:24,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106135184] [2024-11-12 12:36:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106135184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176276915] [2024-11-12 12:36:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:24,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:24,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-12 12:36:24,350 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-12 12:36:24,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-12 12:36:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:24,799 INFO L124 PetriNetUnfolderBase]: 131/2146 cut-off events. [2024-11-12 12:36:24,799 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-12 12:36:24,840 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-12 12:36:24,853 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 20 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2024-11-12 12:36:24,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 560 transitions, 1194 flow [2024-11-12 12:36:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-12 12:36:24,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503433703116746 [2024-11-12 12:36:24,859 INFO L175 Difference]: Start difference. First operand has 555 places, 557 transitions, 1139 flow. Second operand 3 states and 1799 transitions. [2024-11-12 12:36:24,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 560 transitions, 1194 flow [2024-11-12 12:36:24,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 560 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:24,870 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1139 flow [2024-11-12 12:36:24,872 INFO L262 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-12 12:36:24,873 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -35 predicate places. [2024-11-12 12:36:24,873 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1139 flow [2024-11-12 12:36:24,874 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-12 12:36:24,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:24,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:36:24,875 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-12 12:36:24,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1801575874, now seen corresponding path program 1 times [2024-11-12 12:36:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:24,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318767001] [2024-11-12 12:36:24,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:24,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:24,949 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-12 12:36:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:24,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318767001] [2024-11-12 12:36:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318767001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356685556] [2024-11-12 12:36:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:24,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:24,974 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-12 12:36:24,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:24,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:24,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:25,226 INFO L124 PetriNetUnfolderBase]: 63/1137 cut-off events. [2024-11-12 12:36:25,226 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2024-11-12 12:36:25,243 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-12 12:36:25,250 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-11-12 12:36:25,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 556 transitions, 1173 flow [2024-11-12 12:36:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-12 12:36:25,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-12 12:36:25,255 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1139 flow. Second operand 3 states and 1804 transitions. [2024-11-12 12:36:25,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 556 transitions, 1173 flow [2024-11-12 12:36:25,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1173 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:36:25,265 INFO L231 Difference]: Finished difference. Result has 553 places, 554 transitions, 1141 flow [2024-11-12 12:36:25,266 INFO L262 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-12 12:36:25,267 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2024-11-12 12:36:25,267 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 554 transitions, 1141 flow [2024-11-12 12:36:25,269 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-12 12:36:25,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:25,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:25,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:36:25,269 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-12 12:36:25,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1148090203, now seen corresponding path program 1 times [2024-11-12 12:36:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:25,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316823168] [2024-11-12 12:36:25,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:25,566 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-12 12:36:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:25,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316823168] [2024-11-12 12:36:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316823168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:36:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281851861] [2024-11-12 12:36:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:25,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:36:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:25,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:36:25,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:36:26,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-12 12:36:26,143 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-12 12:36:26,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:26,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-12 12:36:26,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:26,630 INFO L124 PetriNetUnfolderBase]: 98/1577 cut-off events. [2024-11-12 12:36:26,630 INFO L125 PetriNetUnfolderBase]: For 6/38 co-relation queries the response was YES. [2024-11-12 12:36:26,656 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-12 12:36:26,666 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 69 selfloop transitions, 15 changer transitions 0/592 dead transitions. [2024-11-12 12:36:26,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 592 transitions, 1401 flow [2024-11-12 12:36:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:36:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 12:36:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2024-11-12 12:36:26,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9075061230370264 [2024-11-12 12:36:26,681 INFO L175 Difference]: Start difference. First operand has 553 places, 554 transitions, 1141 flow. Second operand 11 states and 6299 transitions. [2024-11-12 12:36:26,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 592 transitions, 1401 flow [2024-11-12 12:36:26,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 592 transitions, 1397 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:26,695 INFO L231 Difference]: Finished difference. Result has 566 places, 562 transitions, 1213 flow [2024-11-12 12:36:26,697 INFO L262 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-12 12:36:26,697 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -21 predicate places. [2024-11-12 12:36:26,698 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 562 transitions, 1213 flow [2024-11-12 12:36:26,704 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-12 12:36:26,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:26,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:26,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:36:26,705 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-12 12:36:26,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -91014793, now seen corresponding path program 1 times [2024-11-12 12:36:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925775797] [2024-11-12 12:36:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:26,780 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-12 12:36:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925775797] [2024-11-12 12:36:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925775797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:36:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995583280] [2024-11-12 12:36:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:26,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:26,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:26,800 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-12 12:36:26,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:26,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:26,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:27,273 INFO L124 PetriNetUnfolderBase]: 132/1836 cut-off events. [2024-11-12 12:36:27,274 INFO L125 PetriNetUnfolderBase]: For 91/154 co-relation queries the response was YES. [2024-11-12 12:36:27,306 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-12 12:36:27,316 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2024-11-12 12:36:27,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 565 transitions, 1255 flow [2024-11-12 12:36:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-12 12:36:27,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-12 12:36:27,322 INFO L175 Difference]: Start difference. First operand has 566 places, 562 transitions, 1213 flow. Second operand 3 states and 1806 transitions. [2024-11-12 12:36:27,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 565 transitions, 1255 flow [2024-11-12 12:36:27,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 565 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:27,335 INFO L231 Difference]: Finished difference. Result has 569 places, 563 transitions, 1227 flow [2024-11-12 12:36:27,335 INFO L262 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-12 12:36:27,336 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2024-11-12 12:36:27,336 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 563 transitions, 1227 flow [2024-11-12 12:36:27,337 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-12 12:36:27,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:27,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:27,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:36:27,338 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-12 12:36:27,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1168322408, now seen corresponding path program 1 times [2024-11-12 12:36:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978853058] [2024-11-12 12:36:27,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:27,415 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-12 12:36:27,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:27,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978853058] [2024-11-12 12:36:27,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978853058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:27,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:27,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:36:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880021579] [2024-11-12 12:36:27,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:27,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:27,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:27,430 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-12 12:36:27,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:27,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:27,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:27,873 INFO L124 PetriNetUnfolderBase]: 137/1985 cut-off events. [2024-11-12 12:36:27,873 INFO L125 PetriNetUnfolderBase]: For 68/101 co-relation queries the response was YES. [2024-11-12 12:36:27,902 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-12 12:36:27,916 INFO L140 encePairwiseOnDemand]: 627/631 looper letters, 14 selfloop transitions, 3 changer transitions 0/566 dead transitions. [2024-11-12 12:36:27,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 566 transitions, 1269 flow [2024-11-12 12:36:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-12 12:36:27,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540412044374009 [2024-11-12 12:36:27,921 INFO L175 Difference]: Start difference. First operand has 569 places, 563 transitions, 1227 flow. Second operand 3 states and 1806 transitions. [2024-11-12 12:36:27,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 566 transitions, 1269 flow [2024-11-12 12:36:27,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 566 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:27,932 INFO L231 Difference]: Finished difference. Result has 571 places, 564 transitions, 1239 flow [2024-11-12 12:36:27,933 INFO L262 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-12 12:36:27,934 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -16 predicate places. [2024-11-12 12:36:27,934 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 564 transitions, 1239 flow [2024-11-12 12:36:27,935 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-12 12:36:27,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:27,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:27,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:36:27,936 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-12 12:36:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash -576927796, now seen corresponding path program 1 times [2024-11-12 12:36:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15357128] [2024-11-12 12:36:27,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:27,998 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-12 12:36:27,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15357128] [2024-11-12 12:36:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15357128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:27,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302820573] [2024-11-12 12:36:28,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:28,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:28,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:28,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:28,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-12 12:36:28,023 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-12 12:36:28,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:28,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-12 12:36:28,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:28,727 INFO L124 PetriNetUnfolderBase]: 187/3283 cut-off events. [2024-11-12 12:36:28,727 INFO L125 PetriNetUnfolderBase]: For 58/76 co-relation queries the response was YES. [2024-11-12 12:36:28,772 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-12 12:36:28,785 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 20 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2024-11-12 12:36:28,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 567 transitions, 1294 flow [2024-11-12 12:36:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-12 12:36:28,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503433703116746 [2024-11-12 12:36:28,790 INFO L175 Difference]: Start difference. First operand has 571 places, 564 transitions, 1239 flow. Second operand 3 states and 1799 transitions. [2024-11-12 12:36:28,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 567 transitions, 1294 flow [2024-11-12 12:36:28,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 567 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:28,803 INFO L231 Difference]: Finished difference. Result has 568 places, 562 transitions, 1239 flow [2024-11-12 12:36:28,804 INFO L262 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-12 12:36:28,804 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2024-11-12 12:36:28,805 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 562 transitions, 1239 flow [2024-11-12 12:36:28,805 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-12 12:36:28,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:28,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:28,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:36:28,806 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-12 12:36:28,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1697505040, now seen corresponding path program 1 times [2024-11-12 12:36:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774009195] [2024-11-12 12:36:28,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:29,051 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-12 12:36:29,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:29,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774009195] [2024-11-12 12:36:29,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774009195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:29,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:29,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:36:29,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726874897] [2024-11-12 12:36:29,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:29,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:36:29,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:29,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:36:29,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:36:29,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-12 12:36:29,761 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-12 12:36:29,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:29,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-12 12:36:29,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:30,392 INFO L124 PetriNetUnfolderBase]: 170/2424 cut-off events. [2024-11-12 12:36:30,392 INFO L125 PetriNetUnfolderBase]: For 82/134 co-relation queries the response was YES. [2024-11-12 12:36:30,442 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-12 12:36:30,457 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 69 selfloop transitions, 15 changer transitions 0/595 dead transitions. [2024-11-12 12:36:30,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 595 transitions, 1489 flow [2024-11-12 12:36:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:36:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 12:36:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2024-11-12 12:36:30,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9075061230370264 [2024-11-12 12:36:30,469 INFO L175 Difference]: Start difference. First operand has 568 places, 562 transitions, 1239 flow. Second operand 11 states and 6299 transitions. [2024-11-12 12:36:30,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 595 transitions, 1489 flow [2024-11-12 12:36:30,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 595 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:36:30,479 INFO L231 Difference]: Finished difference. Result has 581 places, 565 transitions, 1294 flow [2024-11-12 12:36:30,480 INFO L262 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-12 12:36:30,481 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -6 predicate places. [2024-11-12 12:36:30,481 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 565 transitions, 1294 flow [2024-11-12 12:36:30,482 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-12 12:36:30,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:30,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:30,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 12:36:30,483 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-12 12:36:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash 54425104, now seen corresponding path program 1 times [2024-11-12 12:36:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:30,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092040010] [2024-11-12 12:36:30,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:30,797 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-12 12:36:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092040010] [2024-11-12 12:36:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092040010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:36:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727971609] [2024-11-12 12:36:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:30,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:36:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:30,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:36:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:36:31,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-12 12:36:31,257 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-12 12:36:31,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:31,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-12 12:36:31,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:32,064 INFO L124 PetriNetUnfolderBase]: 245/3127 cut-off events. [2024-11-12 12:36:32,064 INFO L125 PetriNetUnfolderBase]: For 227/285 co-relation queries the response was YES. [2024-11-12 12:36:32,102 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-12 12:36:32,114 INFO L140 encePairwiseOnDemand]: 617/631 looper letters, 65 selfloop transitions, 15 changer transitions 0/594 dead transitions. [2024-11-12 12:36:32,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 594 transitions, 1528 flow [2024-11-12 12:36:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:36:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 12:36:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6290 transitions. [2024-11-12 12:36:32,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062094799020314 [2024-11-12 12:36:32,128 INFO L175 Difference]: Start difference. First operand has 581 places, 565 transitions, 1294 flow. Second operand 11 states and 6290 transitions. [2024-11-12 12:36:32,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 594 transitions, 1528 flow [2024-11-12 12:36:32,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1507 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-12 12:36:32,141 INFO L231 Difference]: Finished difference. Result has 589 places, 573 transitions, 1349 flow [2024-11-12 12:36:32,142 INFO L262 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-12 12:36:32,142 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 2 predicate places. [2024-11-12 12:36:32,143 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 573 transitions, 1349 flow [2024-11-12 12:36:32,144 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-12 12:36:32,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:32,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:32,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 12:36:32,145 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-12 12:36:32,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:32,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1256598994, now seen corresponding path program 1 times [2024-11-12 12:36:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:32,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935573129] [2024-11-12 12:36:32,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:32,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:32,402 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-12 12:36:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935573129] [2024-11-12 12:36:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935573129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:32,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:32,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:36:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040519428] [2024-11-12 12:36:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:32,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:36:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:36:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:36:32,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-12 12:36:32,892 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-12 12:36:32,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:32,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-12 12:36:32,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:33,511 INFO L124 PetriNetUnfolderBase]: 147/2380 cut-off events. [2024-11-12 12:36:33,512 INFO L125 PetriNetUnfolderBase]: For 118/172 co-relation queries the response was YES. [2024-11-12 12:36:33,538 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-12 12:36:33,546 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 71 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2024-11-12 12:36:33,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 603 transitions, 1627 flow [2024-11-12 12:36:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:36:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 12:36:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6292 transitions. [2024-11-12 12:36:33,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064976228209192 [2024-11-12 12:36:33,557 INFO L175 Difference]: Start difference. First operand has 589 places, 573 transitions, 1349 flow. Second operand 11 states and 6292 transitions. [2024-11-12 12:36:33,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 603 transitions, 1627 flow [2024-11-12 12:36:33,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 603 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:33,573 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1440 flow [2024-11-12 12:36:33,573 INFO L262 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-12 12:36:33,574 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2024-11-12 12:36:33,574 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1440 flow [2024-11-12 12:36:33,576 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-12 12:36:33,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:33,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:33,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 12:36:33,576 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-12 12:36:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash -248585689, now seen corresponding path program 1 times [2024-11-12 12:36:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94055561] [2024-11-12 12:36:33,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:33,882 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-12 12:36:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94055561] [2024-11-12 12:36:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94055561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:33,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:33,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:36:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379835342] [2024-11-12 12:36:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:33,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:36:33,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:36:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:36:34,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-12 12:36:34,326 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-12 12:36:34,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:34,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-12 12:36:34,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:35,368 INFO L124 PetriNetUnfolderBase]: 338/4947 cut-off events. [2024-11-12 12:36:35,369 INFO L125 PetriNetUnfolderBase]: For 466/624 co-relation queries the response was YES. [2024-11-12 12:36:35,440 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-12 12:36:35,457 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 67 selfloop transitions, 18 changer transitions 0/605 dead transitions. [2024-11-12 12:36:35,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 605 transitions, 1702 flow [2024-11-12 12:36:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:36:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 12:36:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2024-11-12 12:36:35,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9052009796859242 [2024-11-12 12:36:35,461 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1440 flow. Second operand 11 states and 6283 transitions. [2024-11-12 12:36:35,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 605 transitions, 1702 flow [2024-11-12 12:36:35,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 605 transitions, 1681 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-12 12:36:35,475 INFO L231 Difference]: Finished difference. Result has 609 places, 590 transitions, 1535 flow [2024-11-12 12:36:35,476 INFO L262 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-12 12:36:35,476 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 22 predicate places. [2024-11-12 12:36:35,476 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 590 transitions, 1535 flow [2024-11-12 12:36:35,478 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-12 12:36:35,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:35,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:35,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 12:36:35,478 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-12 12:36:35,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1817558710, now seen corresponding path program 1 times [2024-11-12 12:36:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:35,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153860627] [2024-11-12 12:36:35,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:35,716 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-12 12:36:35,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153860627] [2024-11-12 12:36:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153860627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:35,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:35,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:36:35,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486511069] [2024-11-12 12:36:35,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:35,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:36:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:35,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:36:35,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:36:36,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 631 [2024-11-12 12:36:36,172 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-12 12:36:36,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:36,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 631 [2024-11-12 12:36:36,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:36,984 INFO L124 PetriNetUnfolderBase]: 296/3695 cut-off events. [2024-11-12 12:36:36,984 INFO L125 PetriNetUnfolderBase]: For 622/681 co-relation queries the response was YES. [2024-11-12 12:36:37,031 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-12 12:36:37,043 INFO L140 encePairwiseOnDemand]: 616/631 looper letters, 67 selfloop transitions, 18 changer transitions 0/611 dead transitions. [2024-11-12 12:36:37,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 611 transitions, 1787 flow [2024-11-12 12:36:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:36:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 12:36:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2024-11-12 12:36:37,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9052009796859242 [2024-11-12 12:36:37,048 INFO L175 Difference]: Start difference. First operand has 609 places, 590 transitions, 1535 flow. Second operand 11 states and 6283 transitions. [2024-11-12 12:36:37,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 611 transitions, 1787 flow [2024-11-12 12:36:37,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 611 transitions, 1783 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:37,060 INFO L231 Difference]: Finished difference. Result has 621 places, 596 transitions, 1626 flow [2024-11-12 12:36:37,061 INFO L262 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-12 12:36:37,062 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 34 predicate places. [2024-11-12 12:36:37,062 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 596 transitions, 1626 flow [2024-11-12 12:36:37,063 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-12 12:36:37,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:37,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:37,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 12:36:37,064 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-12 12:36:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1086944830, now seen corresponding path program 1 times [2024-11-12 12:36:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461687900] [2024-11-12 12:36:37,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:37,792 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-12 12:36:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:37,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461687900] [2024-11-12 12:36:37,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461687900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:37,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:37,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847249458] [2024-11-12 12:36:37,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:37,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:38,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-12 12:36:38,281 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-12 12:36:38,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:38,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-12 12:36:38,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:39,040 INFO L124 PetriNetUnfolderBase]: 157/3538 cut-off events. [2024-11-12 12:36:39,040 INFO L125 PetriNetUnfolderBase]: For 561/605 co-relation queries the response was YES. [2024-11-12 12:36:39,080 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-12 12:36:39,090 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 41 selfloop transitions, 5 changer transitions 0/605 dead transitions. [2024-11-12 12:36:39,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 605 transitions, 1747 flow [2024-11-12 12:36:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2024-11-12 12:36:39,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247226624405706 [2024-11-12 12:36:39,094 INFO L175 Difference]: Start difference. First operand has 621 places, 596 transitions, 1626 flow. Second operand 6 states and 3501 transitions. [2024-11-12 12:36:39,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 605 transitions, 1747 flow [2024-11-12 12:36:39,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 605 transitions, 1726 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-12 12:36:39,107 INFO L231 Difference]: Finished difference. Result has 617 places, 594 transitions, 1611 flow [2024-11-12 12:36:39,108 INFO L262 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-12 12:36:39,108 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 30 predicate places. [2024-11-12 12:36:39,108 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 594 transitions, 1611 flow [2024-11-12 12:36:39,109 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-12 12:36:39,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:39,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:39,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 12:36:39,110 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-12 12:36:39,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1412690005, now seen corresponding path program 1 times [2024-11-12 12:36:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100266287] [2024-11-12 12:36:39,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:39,705 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-12 12:36:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100266287] [2024-11-12 12:36:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100266287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:39,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831439105] [2024-11-12 12:36:39,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:39,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:40,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-12 12:36:40,254 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-12 12:36:40,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:40,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-12 12:36:40,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:40,893 INFO L124 PetriNetUnfolderBase]: 186/3895 cut-off events. [2024-11-12 12:36:40,893 INFO L125 PetriNetUnfolderBase]: For 644/742 co-relation queries the response was YES. [2024-11-12 12:36:40,951 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-12 12:36:40,963 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 40 selfloop transitions, 5 changer transitions 0/602 dead transitions. [2024-11-12 12:36:40,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 602 transitions, 1727 flow [2024-11-12 12:36:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2024-11-12 12:36:40,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244585314315901 [2024-11-12 12:36:40,966 INFO L175 Difference]: Start difference. First operand has 617 places, 594 transitions, 1611 flow. Second operand 6 states and 3500 transitions. [2024-11-12 12:36:40,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 602 transitions, 1727 flow [2024-11-12 12:36:40,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 602 transitions, 1717 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:40,977 INFO L231 Difference]: Finished difference. Result has 615 places, 592 transitions, 1607 flow [2024-11-12 12:36:40,977 INFO L262 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-12 12:36:40,978 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 28 predicate places. [2024-11-12 12:36:40,978 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 592 transitions, 1607 flow [2024-11-12 12:36:40,979 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-12 12:36:40,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:40,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:40,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 12:36:40,979 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-12 12:36:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -385378515, now seen corresponding path program 1 times [2024-11-12 12:36:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:40,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559410562] [2024-11-12 12:36:40,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:41,044 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-12 12:36:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559410562] [2024-11-12 12:36:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559410562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795404994] [2024-11-12 12:36:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:41,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:41,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:41,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 631 [2024-11-12 12:36:41,063 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-12 12:36:41,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:41,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 631 [2024-11-12 12:36:41,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:42,062 INFO L124 PetriNetUnfolderBase]: 328/6084 cut-off events. [2024-11-12 12:36:42,062 INFO L125 PetriNetUnfolderBase]: For 458/478 co-relation queries the response was YES. [2024-11-12 12:36:42,136 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-12 12:36:42,150 INFO L140 encePairwiseOnDemand]: 625/631 looper letters, 19 selfloop transitions, 2 changer transitions 0/594 dead transitions. [2024-11-12 12:36:42,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 594 transitions, 1657 flow [2024-11-12 12:36:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-12 12:36:42,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498151082937136 [2024-11-12 12:36:42,152 INFO L175 Difference]: Start difference. First operand has 615 places, 592 transitions, 1607 flow. Second operand 3 states and 1798 transitions. [2024-11-12 12:36:42,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 594 transitions, 1657 flow [2024-11-12 12:36:42,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 594 transitions, 1647 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:42,163 INFO L231 Difference]: Finished difference. Result has 609 places, 590 transitions, 1603 flow [2024-11-12 12:36:42,164 INFO L262 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-12 12:36:42,164 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 22 predicate places. [2024-11-12 12:36:42,164 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 590 transitions, 1603 flow [2024-11-12 12:36:42,165 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-12 12:36:42,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:42,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:42,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 12:36:42,165 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-12 12:36:42,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1246765924, now seen corresponding path program 1 times [2024-11-12 12:36:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:42,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129932591] [2024-11-12 12:36:42,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:42,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:42,641 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-12 12:36:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129932591] [2024-11-12 12:36:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129932591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:42,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:42,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:42,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050946412] [2024-11-12 12:36:42,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:42,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:42,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:42,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:43,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-12 12:36:43,145 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-12 12:36:43,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:43,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-12 12:36:43,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:43,717 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-12 12:36:43,717 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-12 12:36:43,717 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-12 12:36:43,717 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-12 12:36:43,717 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-12 12:36:43,740 INFO L124 PetriNetUnfolderBase]: 161/3896 cut-off events. [2024-11-12 12:36:43,741 INFO L125 PetriNetUnfolderBase]: For 546/602 co-relation queries the response was YES. [2024-11-12 12:36:43,790 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-12 12:36:43,799 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 41 selfloop transitions, 5 changer transitions 0/599 dead transitions. [2024-11-12 12:36:43,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 599 transitions, 1724 flow [2024-11-12 12:36:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2024-11-12 12:36:43,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247226624405706 [2024-11-12 12:36:43,802 INFO L175 Difference]: Start difference. First operand has 609 places, 590 transitions, 1603 flow. Second operand 6 states and 3501 transitions. [2024-11-12 12:36:43,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 599 transitions, 1724 flow [2024-11-12 12:36:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 599 transitions, 1724 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:36:43,817 INFO L231 Difference]: Finished difference. Result has 612 places, 588 transitions, 1609 flow [2024-11-12 12:36:43,818 INFO L262 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-12 12:36:43,819 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 25 predicate places. [2024-11-12 12:36:43,819 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 588 transitions, 1609 flow [2024-11-12 12:36:43,819 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-12 12:36:43,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:43,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:43,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 12:36:43,820 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-12 12:36:43,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash 593186536, now seen corresponding path program 1 times [2024-11-12 12:36:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:43,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225294270] [2024-11-12 12:36:43,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:44,290 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-12 12:36:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225294270] [2024-11-12 12:36:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225294270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083136146] [2024-11-12 12:36:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:44,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:44,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-12 12:36:44,762 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-12 12:36:44,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:44,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-12 12:36:44,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:45,348 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-12 12:36:45,348 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-12 12:36:45,348 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-12 12:36:45,348 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-12 12:36:45,348 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-12 12:36:45,354 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-12 12:36:45,354 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-12 12:36:45,354 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-12 12:36:45,354 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-12 12:36:45,354 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-12 12:36:45,359 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-12 12:36:45,359 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-12 12:36:45,359 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-12 12:36:45,359 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-12 12:36:45,359 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-12 12:36:45,363 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-12 12:36:45,363 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-11-12 12:36:45,363 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-12 12:36:45,364 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-12 12:36:45,364 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-12 12:36:45,367 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-12 12:36:45,367 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-12 12:36:45,367 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-12 12:36:45,367 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-12 12:36:45,367 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-12 12:36:45,511 INFO L124 PetriNetUnfolderBase]: 334/4764 cut-off events. [2024-11-12 12:36:45,511 INFO L125 PetriNetUnfolderBase]: For 884/932 co-relation queries the response was YES. [2024-11-12 12:36:45,571 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-12 12:36:45,583 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 39 selfloop transitions, 5 changer transitions 0/595 dead transitions. [2024-11-12 12:36:45,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 595 transitions, 1720 flow [2024-11-12 12:36:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-12 12:36:45,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241944004226096 [2024-11-12 12:36:45,585 INFO L175 Difference]: Start difference. First operand has 612 places, 588 transitions, 1609 flow. Second operand 6 states and 3499 transitions. [2024-11-12 12:36:45,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 595 transitions, 1720 flow [2024-11-12 12:36:45,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 595 transitions, 1710 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:45,598 INFO L231 Difference]: Finished difference. Result has 610 places, 586 transitions, 1605 flow [2024-11-12 12:36:45,599 INFO L262 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-12 12:36:45,602 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 23 predicate places. [2024-11-12 12:36:45,602 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 586 transitions, 1605 flow [2024-11-12 12:36:45,602 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-12 12:36:45,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:45,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:45,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 12:36:45,603 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-12 12:36:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -752309935, now seen corresponding path program 1 times [2024-11-12 12:36:45,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:45,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136398034] [2024-11-12 12:36:45,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:45,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:36:46,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:46,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136398034] [2024-11-12 12:36:46,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136398034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:46,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:46,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:46,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929222259] [2024-11-12 12:36:46,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:46,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:46,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:46,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-12 12:36:46,438 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-12 12:36:46,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:46,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-12 12:36:46,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:47,109 INFO L124 PetriNetUnfolderBase]: 195/4259 cut-off events. [2024-11-12 12:36:47,110 INFO L125 PetriNetUnfolderBase]: For 629/721 co-relation queries the response was YES. [2024-11-12 12:36:47,164 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-12 12:36:47,174 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 40 selfloop transitions, 5 changer transitions 0/594 dead transitions. [2024-11-12 12:36:47,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 594 transitions, 1721 flow [2024-11-12 12:36:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2024-11-12 12:36:47,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244585314315901 [2024-11-12 12:36:47,176 INFO L175 Difference]: Start difference. First operand has 610 places, 586 transitions, 1605 flow. Second operand 6 states and 3500 transitions. [2024-11-12 12:36:47,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 594 transitions, 1721 flow [2024-11-12 12:36:47,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 594 transitions, 1711 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:47,186 INFO L231 Difference]: Finished difference. Result has 608 places, 584 transitions, 1601 flow [2024-11-12 12:36:47,187 INFO L262 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-12 12:36:47,187 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 21 predicate places. [2024-11-12 12:36:47,187 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 584 transitions, 1601 flow [2024-11-12 12:36:47,188 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-12 12:36:47,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:47,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:47,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 12:36:47,188 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-12 12:36:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash -575778182, now seen corresponding path program 1 times [2024-11-12 12:36:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853723779] [2024-11-12 12:36:47,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:47,234 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-12 12:36:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853723779] [2024-11-12 12:36:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853723779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:47,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704599285] [2024-11-12 12:36:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:47,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 631 [2024-11-12 12:36:47,248 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-12 12:36:47,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:47,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 631 [2024-11-12 12:36:47,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:47,811 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-12 12:36:47,812 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-12 12:36:47,812 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-12 12:36:47,812 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-12 12:36:47,812 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-12 12:36:47,870 INFO L124 PetriNetUnfolderBase]: 130/4207 cut-off events. [2024-11-12 12:36:47,871 INFO L125 PetriNetUnfolderBase]: For 517/559 co-relation queries the response was YES. [2024-11-12 12:36:47,920 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-12 12:36:47,929 INFO L140 encePairwiseOnDemand]: 629/631 looper letters, 9 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2024-11-12 12:36:47,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 583 transitions, 1619 flow [2024-11-12 12:36:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2024-11-12 12:36:47,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550977284733227 [2024-11-12 12:36:47,931 INFO L175 Difference]: Start difference. First operand has 608 places, 584 transitions, 1601 flow. Second operand 3 states and 1808 transitions. [2024-11-12 12:36:47,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 583 transitions, 1619 flow [2024-11-12 12:36:47,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 583 transitions, 1609 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:47,942 INFO L231 Difference]: Finished difference. Result has 604 places, 583 transitions, 1591 flow [2024-11-12 12:36:47,943 INFO L262 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-12 12:36:47,943 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 17 predicate places. [2024-11-12 12:36:47,944 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 583 transitions, 1591 flow [2024-11-12 12:36:47,944 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-12 12:36:47,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:47,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:47,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 12:36:47,945 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-12 12:36:47,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1347222258, now seen corresponding path program 1 times [2024-11-12 12:36:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:47,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397885138] [2024-11-12 12:36:47,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:47,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 12:36:48,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397885138] [2024-11-12 12:36:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397885138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:48,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327532324] [2024-11-12 12:36:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:48,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:48,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:48,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 631 [2024-11-12 12:36:48,879 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-12 12:36:48,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:48,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 631 [2024-11-12 12:36:48,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:49,470 INFO L124 PetriNetUnfolderBase]: 220/4123 cut-off events. [2024-11-12 12:36:49,470 INFO L125 PetriNetUnfolderBase]: For 732/761 co-relation queries the response was YES. [2024-11-12 12:36:49,521 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-12 12:36:49,531 INFO L140 encePairwiseOnDemand]: 624/631 looper letters, 39 selfloop transitions, 5 changer transitions 0/590 dead transitions. [2024-11-12 12:36:49,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 590 transitions, 1702 flow [2024-11-12 12:36:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-12 12:36:49,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241944004226096 [2024-11-12 12:36:49,534 INFO L175 Difference]: Start difference. First operand has 604 places, 583 transitions, 1591 flow. Second operand 6 states and 3499 transitions. [2024-11-12 12:36:49,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 590 transitions, 1702 flow [2024-11-12 12:36:49,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 590 transitions, 1701 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:49,548 INFO L231 Difference]: Finished difference. Result has 606 places, 581 transitions, 1596 flow [2024-11-12 12:36:49,548 INFO L262 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-12 12:36:49,549 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 19 predicate places. [2024-11-12 12:36:49,549 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 581 transitions, 1596 flow [2024-11-12 12:36:49,550 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-12 12:36:49,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:49,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 12:36:49,550 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-12 12:36:49,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -943953569, now seen corresponding path program 1 times [2024-11-12 12:36:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268813371] [2024-11-12 12:36:49,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:49,599 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-12 12:36:49,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:49,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268813371] [2024-11-12 12:36:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268813371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:49,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:49,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093543659] [2024-11-12 12:36:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:49,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:49,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:49,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:49,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:49,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:49,616 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-12 12:36:49,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:49,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:49,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:50,069 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-12 12:36:50,069 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-12 12:36:50,069 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-12 12:36:50,069 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-12 12:36:50,069 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-12 12:36:50,128 INFO L124 PetriNetUnfolderBase]: 120/3723 cut-off events. [2024-11-12 12:36:50,128 INFO L125 PetriNetUnfolderBase]: For 431/497 co-relation queries the response was YES. [2024-11-12 12:36:50,177 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-12 12:36:50,184 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 11 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2024-11-12 12:36:50,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 579 transitions, 1616 flow [2024-11-12 12:36:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2024-11-12 12:36:50,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519281563655573 [2024-11-12 12:36:50,186 INFO L175 Difference]: Start difference. First operand has 606 places, 581 transitions, 1596 flow. Second operand 3 states and 1802 transitions. [2024-11-12 12:36:50,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 579 transitions, 1616 flow [2024-11-12 12:36:50,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 579 transitions, 1606 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:50,195 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1584 flow [2024-11-12 12:36:50,196 INFO L262 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-12 12:36:50,196 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2024-11-12 12:36:50,196 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1584 flow [2024-11-12 12:36:50,197 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-12 12:36:50,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:50,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:50,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 12:36:50,197 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-12 12:36:50,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1383982660, now seen corresponding path program 1 times [2024-11-12 12:36:50,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:50,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737560020] [2024-11-12 12:36:50,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:50,257 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-12 12:36:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737560020] [2024-11-12 12:36:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737560020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:50,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:50,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153518193] [2024-11-12 12:36:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:50,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:50,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:50,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:50,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:50,275 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-12 12:36:50,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:50,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:50,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:50,738 INFO L124 PetriNetUnfolderBase]: 120/3068 cut-off events. [2024-11-12 12:36:50,738 INFO L125 PetriNetUnfolderBase]: For 339/379 co-relation queries the response was YES. [2024-11-12 12:36:50,774 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-12 12:36:50,780 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 7 selfloop transitions, 0 changer transitions 24/577 dead transitions. [2024-11-12 12:36:50,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 577 transitions, 1602 flow [2024-11-12 12:36:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-12 12:36:50,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-12 12:36:50,782 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1584 flow. Second operand 3 states and 1801 transitions. [2024-11-12 12:36:50,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 577 transitions, 1602 flow [2024-11-12 12:36:50,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 577 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:50,789 INFO L231 Difference]: Finished difference. Result has 600 places, 553 transitions, 1474 flow [2024-11-12 12:36:50,790 INFO L262 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-12 12:36:50,790 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 13 predicate places. [2024-11-12 12:36:50,790 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 553 transitions, 1474 flow [2024-11-12 12:36:50,790 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-12 12:36:50,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:50,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:50,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 12:36:50,791 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-12 12:36:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1778557083, now seen corresponding path program 1 times [2024-11-12 12:36:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447231246] [2024-11-12 12:36:50,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:50,865 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-12 12:36:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:50,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447231246] [2024-11-12 12:36:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447231246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:50,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274756961] [2024-11-12 12:36:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:50,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:50,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:50,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:50,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 631 [2024-11-12 12:36:50,882 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-12 12:36:50,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:50,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 631 [2024-11-12 12:36:50,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:51,375 INFO L124 PetriNetUnfolderBase]: 140/3562 cut-off events. [2024-11-12 12:36:51,375 INFO L125 PetriNetUnfolderBase]: For 330/350 co-relation queries the response was YES. [2024-11-12 12:36:51,425 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-12 12:36:51,431 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 10 selfloop transitions, 2 changer transitions 12/554 dead transitions. [2024-11-12 12:36:51,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 554 transitions, 1502 flow [2024-11-12 12:36:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-12 12:36:51,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529846804014791 [2024-11-12 12:36:51,434 INFO L175 Difference]: Start difference. First operand has 600 places, 553 transitions, 1474 flow. Second operand 3 states and 1804 transitions. [2024-11-12 12:36:51,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 554 transitions, 1502 flow [2024-11-12 12:36:51,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 554 transitions, 1490 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-12 12:36:51,446 INFO L231 Difference]: Finished difference. Result has 580 places, 540 transitions, 1382 flow [2024-11-12 12:36:51,447 INFO L262 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-12 12:36:51,447 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -7 predicate places. [2024-11-12 12:36:51,447 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 540 transitions, 1382 flow [2024-11-12 12:36:51,448 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-12 12:36:51,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:51,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-12 12:36:51,448 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-12 12:36:51,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1554249013, now seen corresponding path program 1 times [2024-11-12 12:36:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:51,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826947572] [2024-11-12 12:36:51,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 12:36:51,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:51,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826947572] [2024-11-12 12:36:51,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826947572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:51,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:51,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:51,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638852499] [2024-11-12 12:36:51,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:51,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:51,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:51,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:51,539 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-12 12:36:51,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:51,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:51,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:51,923 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-12 12:36:51,923 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-12 12:36:51,923 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-12 12:36:51,923 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-12 12:36:51,923 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-12 12:36:51,965 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-12 12:36:51,965 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-12 12:36:51,965 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-12 12:36:51,965 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-12 12:36:51,965 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-12 12:36:51,971 INFO L124 PetriNetUnfolderBase]: 135/2905 cut-off events. [2024-11-12 12:36:51,971 INFO L125 PetriNetUnfolderBase]: For 200/223 co-relation queries the response was YES. [2024-11-12 12:36:52,012 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-12 12:36:52,018 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 10 selfloop transitions, 2 changer transitions 11/541 dead transitions. [2024-11-12 12:36:52,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 541 transitions, 1410 flow [2024-11-12 12:36:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-12 12:36:52,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-12 12:36:52,021 INFO L175 Difference]: Start difference. First operand has 580 places, 540 transitions, 1382 flow. Second operand 3 states and 1801 transitions. [2024-11-12 12:36:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 541 transitions, 1410 flow [2024-11-12 12:36:52,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 541 transitions, 1364 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-11-12 12:36:52,031 INFO L231 Difference]: Finished difference. Result has 561 places, 528 transitions, 1266 flow [2024-11-12 12:36:52,031 INFO L262 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-12 12:36:52,032 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -26 predicate places. [2024-11-12 12:36:52,032 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 528 transitions, 1266 flow [2024-11-12 12:36:52,032 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-12 12:36:52,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:52,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:36:52,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 12:36:52,033 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-12 12:36:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1386353249, now seen corresponding path program 1 times [2024-11-12 12:36:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:52,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844723665] [2024-11-12 12:36:52,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 12:36:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844723665] [2024-11-12 12:36:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844723665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:52,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541842725] [2024-11-12 12:36:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:52,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:52,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 631 [2024-11-12 12:36:52,152 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-12 12:36:52,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:52,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 631 [2024-11-12 12:36:52,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:52,496 INFO L124 PetriNetUnfolderBase]: 107/1753 cut-off events. [2024-11-12 12:36:52,497 INFO L125 PetriNetUnfolderBase]: For 69/91 co-relation queries the response was YES. [2024-11-12 12:36:52,522 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-12 12:36:52,523 INFO L140 encePairwiseOnDemand]: 628/631 looper letters, 0 selfloop transitions, 0 changer transitions 529/529 dead transitions. [2024-11-12 12:36:52,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 529 transitions, 1294 flow [2024-11-12 12:36:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-12 12:36:52,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513998943475964 [2024-11-12 12:36:52,525 INFO L175 Difference]: Start difference. First operand has 561 places, 528 transitions, 1266 flow. Second operand 3 states and 1801 transitions. [2024-11-12 12:36:52,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 529 transitions, 1294 flow [2024-11-12 12:36:52,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 529 transitions, 1252 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-12 12:36:52,530 INFO L231 Difference]: Finished difference. Result has 542 places, 0 transitions, 0 flow [2024-11-12 12:36:52,531 INFO L262 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-12 12:36:52,531 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -45 predicate places. [2024-11-12 12:36:52,531 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 0 transitions, 0 flow [2024-11-12 12:36:52,532 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-12 12:36:52,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (103 of 104 remaining) [2024-11-12 12:36:52,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2024-11-12 12:36:52,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2024-11-12 12:36:52,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2024-11-12 12:36:52,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2024-11-12 12:36:52,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2024-11-12 12:36:52,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2024-11-12 12:36:52,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2024-11-12 12:36:52,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2024-11-12 12:36:52,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2024-11-12 12:36:52,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2024-11-12 12:36:52,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2024-11-12 12:36:52,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2024-11-12 12:36:52,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2024-11-12 12:36:52,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2024-11-12 12:36:52,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2024-11-12 12:36:52,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2024-11-12 12:36:52,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2024-11-12 12:36:52,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2024-11-12 12:36:52,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2024-11-12 12:36:52,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2024-11-12 12:36:52,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2024-11-12 12:36:52,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2024-11-12 12:36:52,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2024-11-12 12:36:52,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2024-11-12 12:36:52,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2024-11-12 12:36:52,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2024-11-12 12:36:52,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2024-11-12 12:36:52,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2024-11-12 12:36:52,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2024-11-12 12:36:52,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2024-11-12 12:36:52,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2024-11-12 12:36:52,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2024-11-12 12:36:52,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2024-11-12 12:36:52,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2024-11-12 12:36:52,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2024-11-12 12:36:52,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2024-11-12 12:36:52,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2024-11-12 12:36:52,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2024-11-12 12:36:52,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (50 of 104 remaining) [2024-11-12 12:36:52,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (49 of 104 remaining) [2024-11-12 12:36:52,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (48 of 104 remaining) [2024-11-12 12:36:52,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (47 of 104 remaining) [2024-11-12 12:36:52,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (46 of 104 remaining) [2024-11-12 12:36:52,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (45 of 104 remaining) [2024-11-12 12:36:52,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 104 remaining) [2024-11-12 12:36:52,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 104 remaining) [2024-11-12 12:36:52,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 104 remaining) [2024-11-12 12:36:52,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2024-11-12 12:36:52,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2024-11-12 12:36:52,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2024-11-12 12:36:52,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2024-11-12 12:36:52,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2024-11-12 12:36:52,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2024-11-12 12:36:52,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2024-11-12 12:36:52,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2024-11-12 12:36:52,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2024-11-12 12:36:52,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2024-11-12 12:36:52,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2024-11-12 12:36:52,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2024-11-12 12:36:52,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2024-11-12 12:36:52,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2024-11-12 12:36:52,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2024-11-12 12:36:52,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2024-11-12 12:36:52,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2024-11-12 12:36:52,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-12 12:36:52,552 INFO L421 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-12 12:36:52,558 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:36:52,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:36:52,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:36:52 BasicIcfg [2024-11-12 12:36:52,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:36:52,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:36:52,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:36:52,568 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:36:52,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:36:06" (3/4) ... [2024-11-12 12:36:52,570 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:36:52,574 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:36:52,574 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:36:52,574 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-12 12:36:52,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-12 12:36:52,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:36:52,585 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:36:52,585 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:36:52,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:36:52,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:36:52,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:36:52,685 INFO L158 Benchmark]: Toolchain (without parser) took 47274.25ms. Allocated memory was 140.5MB in the beginning and 8.2GB in the end (delta: 8.1GB). Free memory was 98.0MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-12 12:36:52,685 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:36:52,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.54ms. Allocated memory is still 140.5MB. Free memory was 97.6MB in the beginning and 82.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:36:52,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.11ms. Allocated memory is still 140.5MB. Free memory was 82.1MB in the beginning and 77.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:36:52,686 INFO L158 Benchmark]: Boogie Preprocessor took 74.05ms. Allocated memory is still 140.5MB. Free memory was 77.9MB in the beginning and 74.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:36:52,686 INFO L158 Benchmark]: RCFGBuilder took 992.61ms. Allocated memory is still 140.5MB. Free memory was 74.2MB in the beginning and 70.3MB in the end (delta: 3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 12:36:52,687 INFO L158 Benchmark]: TraceAbstraction took 45640.21ms. Allocated memory was 140.5MB in the beginning and 8.2GB in the end (delta: 8.1GB). Free memory was 69.5MB in the beginning and 5.7GB in the end (delta: -5.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-12 12:36:52,687 INFO L158 Benchmark]: Witness Printer took 116.82ms. Allocated memory is still 8.2GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 12:36:52,688 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.20ms. Allocated memory is still 109.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.54ms. Allocated memory is still 140.5MB. Free memory was 97.6MB in the beginning and 82.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.11ms. Allocated memory is still 140.5MB. Free memory was 82.1MB in the beginning and 77.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.05ms. Allocated memory is still 140.5MB. Free memory was 77.9MB in the beginning and 74.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 992.61ms. Allocated memory is still 140.5MB. Free memory was 74.2MB in the beginning and 70.3MB in the end (delta: 3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45640.21ms. Allocated memory was 140.5MB in the beginning and 8.2GB in the end (delta: 8.1GB). Free memory was 69.5MB in the beginning and 5.7GB in the end (delta: -5.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 116.82ms. Allocated memory is still 8.2GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 45.3s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6673 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4306 mSDsluCounter, 6620 SdHoareTripleChecker+Invalid, 6.4s 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.8s 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.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 6303 NumberOfCodeBlocks, 6303 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6266 ConstructedInterpolants, 0 QuantifiedInterpolants, 8598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 40/40 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-12 12:36:52,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE