./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:21,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:21,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:13:21,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:21,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:21,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:21,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:21,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:21,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:21,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:21,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:21,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:21,796 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:21,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:21,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:21,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:21,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:21,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:21,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:21,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:21,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:21,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:21,801 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:21,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:21,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:21,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:21,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:21,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:21,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:21,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:21,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:21,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:21,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:21,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:21,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:21,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:21,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:21,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:21,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:21,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:21,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:21,806 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2024-10-11 17:13:22,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:22,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:22,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:22,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:22,030 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:22,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2024-10-11 17:13:23,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:23,396 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:23,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2024-10-11 17:13:23,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d6438e175/35ec70c8342a46c097ca66da50ddcb04/FLAG6ed8d0cb8 [2024-10-11 17:13:23,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d6438e175/35ec70c8342a46c097ca66da50ddcb04 [2024-10-11 17:13:23,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:23,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:23,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:23,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:23,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:23,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@490c3a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23, skipping insertion in model container [2024-10-11 17:13:23,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:23,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:23,645 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:23,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:23,682 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:23,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23 WrapperNode [2024-10-11 17:13:23,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:23,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:23,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:23,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:23,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,733 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 484 [2024-10-11 17:13:23,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:23,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:23,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:23,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:23,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:23,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:23,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:23,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:23,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:23,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:13:23,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:13:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:23,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:23,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:13:23,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:13:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:23,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:13:23,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:13:23,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:23,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:23,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:13:23,861 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:13:23,982 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:23,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:24,614 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:24,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:24,645 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:24,647 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 17:13:24,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:24 BoogieIcfgContainer [2024-10-11 17:13:24,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:24,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:24,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:24,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:24,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:23" (1/3) ... [2024-10-11 17:13:24,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76233f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:24, skipping insertion in model container [2024-10-11 17:13:24,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (2/3) ... [2024-10-11 17:13:24,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76233f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:24, skipping insertion in model container [2024-10-11 17:13:24,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:24" (3/3) ... [2024-10-11 17:13:24,654 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2024-10-11 17:13:24,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:24,670 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-10-11 17:13:24,670 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:24,864 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:13:24,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 599 places, 622 transitions, 1265 flow [2024-10-11 17:13:25,092 INFO L124 PetriNetUnfolderBase]: 33/619 cut-off events. [2024-10-11 17:13:25,092 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:13:25,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 619 events. 33/619 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1465 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 467. Up to 3 conditions per place. [2024-10-11 17:13:25,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 599 places, 622 transitions, 1265 flow [2024-10-11 17:13:25,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 598 transitions, 1214 flow [2024-10-11 17:13:25,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:25,137 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;@41cfb3a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:25,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-10-11 17:13:25,140 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:25,140 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-11 17:13:25,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:25,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:25,141 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:25,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:25,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash 832723251, now seen corresponding path program 1 times [2024-10-11 17:13:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:25,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565666284] [2024-10-11 17:13:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:25,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565666284] [2024-10-11 17:13:25,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565666284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:25,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851936294] [2024-10-11 17:13:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:25,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:25,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:25,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:25,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-10-11 17:13:25,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 598 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:25,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:25,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-10-11 17:13:25,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:25,571 INFO L124 PetriNetUnfolderBase]: 37/1035 cut-off events. [2024-10-11 17:13:25,571 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:13:25,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1035 events. 37/1035 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4609 event pairs, 12 based on Foata normal form. 34/910 useless extension candidates. Maximal degree in co-relation 832. Up to 39 conditions per place. [2024-10-11 17:13:25,596 INFO L140 encePairwiseOnDemand]: 601/622 looper letters, 14 selfloop transitions, 2 changer transitions 6/579 dead transitions. [2024-10-11 17:13:25,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 579 transitions, 1208 flow [2024-10-11 17:13:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2024-10-11 17:13:25,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9576634512325831 [2024-10-11 17:13:25,612 INFO L175 Difference]: Start difference. First operand has 577 places, 598 transitions, 1214 flow. Second operand 3 states and 1787 transitions. [2024-10-11 17:13:25,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 579 transitions, 1208 flow [2024-10-11 17:13:25,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:13:25,628 INFO L231 Difference]: Finished difference. Result has 572 places, 573 transitions, 1156 flow [2024-10-11 17:13:25,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=570, 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=1156, PETRI_PLACES=572, PETRI_TRANSITIONS=573} [2024-10-11 17:13:25,634 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2024-10-11 17:13:25,635 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 573 transitions, 1156 flow [2024-10-11 17:13:25,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:25,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:25,636 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:25,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:25,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2142416312, now seen corresponding path program 1 times [2024-10-11 17:13:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694421832] [2024-10-11 17:13:25,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:25,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694421832] [2024-10-11 17:13:25,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694421832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:25,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157471551] [2024-10-11 17:13:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:25,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:25,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:25,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:25,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-10-11 17:13:25,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:25,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:25,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-10-11 17:13:25,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:25,971 INFO L124 PetriNetUnfolderBase]: 57/1460 cut-off events. [2024-10-11 17:13:25,972 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:13:25,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 1460 events. 57/1460 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8136 event pairs, 20 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1496. Up to 51 conditions per place. [2024-10-11 17:13:25,991 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-10-11 17:13:25,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 572 transitions, 1186 flow [2024-10-11 17:13:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2024-10-11 17:13:25,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480171489817792 [2024-10-11 17:13:25,995 INFO L175 Difference]: Start difference. First operand has 572 places, 573 transitions, 1156 flow. Second operand 3 states and 1769 transitions. [2024-10-11 17:13:25,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 572 transitions, 1186 flow [2024-10-11 17:13:25,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:26,002 INFO L231 Difference]: Finished difference. Result has 565 places, 572 transitions, 1154 flow [2024-10-11 17:13:26,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=565, PETRI_TRANSITIONS=572} [2024-10-11 17:13:26,004 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -12 predicate places. [2024-10-11 17:13:26,004 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 572 transitions, 1154 flow [2024-10-11 17:13:26,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:26,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:26,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:26,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:13:26,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:26,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:26,007 INFO L85 PathProgramCache]: Analyzing trace with hash 963352904, now seen corresponding path program 1 times [2024-10-11 17:13:26,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:26,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812364671] [2024-10-11 17:13:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812364671] [2024-10-11 17:13:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812364671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:26,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332904157] [2024-10-11 17:13:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:26,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:26,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-10-11 17:13:26,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:26,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:26,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-10-11 17:13:26,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:26,329 INFO L124 PetriNetUnfolderBase]: 57/1447 cut-off events. [2024-10-11 17:13:26,329 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-10-11 17:13:26,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1447 events. 57/1447 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7709 event pairs, 20 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 1467. Up to 51 conditions per place. [2024-10-11 17:13:26,354 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2024-10-11 17:13:26,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 571 transitions, 1184 flow [2024-10-11 17:13:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2024-10-11 17:13:26,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480171489817792 [2024-10-11 17:13:26,359 INFO L175 Difference]: Start difference. First operand has 565 places, 572 transitions, 1154 flow. Second operand 3 states and 1769 transitions. [2024-10-11 17:13:26,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 571 transitions, 1184 flow [2024-10-11 17:13:26,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 571 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:26,366 INFO L231 Difference]: Finished difference. Result has 564 places, 571 transitions, 1152 flow [2024-10-11 17:13:26,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1152, PETRI_PLACES=564, PETRI_TRANSITIONS=571} [2024-10-11 17:13:26,367 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -13 predicate places. [2024-10-11 17:13:26,368 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 571 transitions, 1152 flow [2024-10-11 17:13:26,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:26,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:26,369 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:26,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:13:26,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:26,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -29914970, now seen corresponding path program 1 times [2024-10-11 17:13:26,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:26,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455553394] [2024-10-11 17:13:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455553394] [2024-10-11 17:13:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455553394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:26,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:26,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754790145] [2024-10-11 17:13:26,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:26,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:26,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:26,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:26,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:26,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-10-11 17:13:26,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 571 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:26,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:26,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-10-11 17:13:26,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:26,668 INFO L124 PetriNetUnfolderBase]: 69/1462 cut-off events. [2024-10-11 17:13:26,669 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-11 17:13:26,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1462 events. 69/1462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8299 event pairs, 32 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1509. Up to 80 conditions per place. [2024-10-11 17:13:26,694 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/566 dead transitions. [2024-10-11 17:13:26,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 566 transitions, 1176 flow [2024-10-11 17:13:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-10-11 17:13:26,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-10-11 17:13:26,698 INFO L175 Difference]: Start difference. First operand has 564 places, 571 transitions, 1152 flow. Second operand 3 states and 1762 transitions. [2024-10-11 17:13:26,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 566 transitions, 1176 flow [2024-10-11 17:13:26,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 566 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:26,704 INFO L231 Difference]: Finished difference. Result has 559 places, 566 transitions, 1140 flow [2024-10-11 17:13:26,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=559, PETRI_TRANSITIONS=566} [2024-10-11 17:13:26,706 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -18 predicate places. [2024-10-11 17:13:26,707 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 566 transitions, 1140 flow [2024-10-11 17:13:26,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:26,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:26,708 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:13:26,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash -48097060, now seen corresponding path program 1 times [2024-10-11 17:13:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573118146] [2024-10-11 17:13:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573118146] [2024-10-11 17:13:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573118146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272893596] [2024-10-11 17:13:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:27,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:27,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:27,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 622 [2024-10-11 17:13:27,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 566 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:27,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:27,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 622 [2024-10-11 17:13:27,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:34,652 INFO L124 PetriNetUnfolderBase]: 12108/56067 cut-off events. [2024-10-11 17:13:34,653 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-10-11 17:13:34,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73548 conditions, 56067 events. 12108/56067 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 783483 event pairs, 10080 based on Foata normal form. 0/48897 useless extension candidates. Maximal degree in co-relation 73499. Up to 17156 conditions per place. [2024-10-11 17:13:35,235 INFO L140 encePairwiseOnDemand]: 604/622 looper letters, 78 selfloop transitions, 15 changer transitions 0/563 dead transitions. [2024-10-11 17:13:35,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 563 transitions, 1320 flow [2024-10-11 17:13:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3132 transitions. [2024-10-11 17:13:35,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8392282958199357 [2024-10-11 17:13:35,244 INFO L175 Difference]: Start difference. First operand has 559 places, 566 transitions, 1140 flow. Second operand 6 states and 3132 transitions. [2024-10-11 17:13:35,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 563 transitions, 1320 flow [2024-10-11 17:13:35,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1319 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:35,250 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1163 flow [2024-10-11 17:13:35,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2024-10-11 17:13:35,252 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -17 predicate places. [2024-10-11 17:13:35,253 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1163 flow [2024-10-11 17:13:35,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:35,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:35,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:13:35,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1074588689, now seen corresponding path program 1 times [2024-10-11 17:13:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791372040] [2024-10-11 17:13:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:35,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:35,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791372040] [2024-10-11 17:13:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791372040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186098875] [2024-10-11 17:13:35,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:35,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:35,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:35,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:35,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-10-11 17:13:35,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:35,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-10-11 17:13:35,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:35,453 INFO L124 PetriNetUnfolderBase]: 37/1040 cut-off events. [2024-10-11 17:13:35,453 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-11 17:13:35,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1040 events. 37/1040 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4525 event pairs, 12 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1057. Up to 38 conditions per place. [2024-10-11 17:13:35,468 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2024-10-11 17:13:35,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1191 flow [2024-10-11 17:13:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-10-11 17:13:35,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-10-11 17:13:35,471 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1163 flow. Second operand 3 states and 1771 transitions. [2024-10-11 17:13:35,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1191 flow [2024-10-11 17:13:35,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 562 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:35,476 INFO L231 Difference]: Finished difference. Result has 556 places, 562 transitions, 1135 flow [2024-10-11 17:13:35,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=556, PETRI_TRANSITIONS=562} [2024-10-11 17:13:35,479 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -21 predicate places. [2024-10-11 17:13:35,479 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 562 transitions, 1135 flow [2024-10-11 17:13:35,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:35,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:35,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:13:35,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:35,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1452556130, now seen corresponding path program 1 times [2024-10-11 17:13:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:35,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675204856] [2024-10-11 17:13:35,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:35,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675204856] [2024-10-11 17:13:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675204856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:35,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:35,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415794023] [2024-10-11 17:13:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:35,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:35,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-10-11 17:13:35,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 562 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:35,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-10-11 17:13:35,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:35,809 INFO L124 PetriNetUnfolderBase]: 137/2474 cut-off events. [2024-10-11 17:13:35,809 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:13:35,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 2474 events. 137/2474 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18314 event pairs, 64 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 2603. Up to 141 conditions per place. [2024-10-11 17:13:35,854 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2024-10-11 17:13:35,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 557 transitions, 1159 flow [2024-10-11 17:13:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-10-11 17:13:35,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-10-11 17:13:35,857 INFO L175 Difference]: Start difference. First operand has 556 places, 562 transitions, 1135 flow. Second operand 3 states and 1762 transitions. [2024-10-11 17:13:35,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 557 transitions, 1159 flow [2024-10-11 17:13:35,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 557 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:35,862 INFO L231 Difference]: Finished difference. Result has 551 places, 557 transitions, 1123 flow [2024-10-11 17:13:35,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=551, PETRI_TRANSITIONS=557} [2024-10-11 17:13:35,864 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2024-10-11 17:13:35,864 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 557 transitions, 1123 flow [2024-10-11 17:13:35,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:35,865 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:35,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:13:35,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:35,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1158170288, now seen corresponding path program 1 times [2024-10-11 17:13:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922784052] [2024-10-11 17:13:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922784052] [2024-10-11 17:13:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922784052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874203710] [2024-10-11 17:13:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:35,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:35,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-10-11 17:13:35,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 557 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:35,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-10-11 17:13:35,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:36,173 INFO L124 PetriNetUnfolderBase]: 63/1714 cut-off events. [2024-10-11 17:13:36,173 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-11 17:13:36,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 1714 events. 63/1714 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9432 event pairs, 20 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1733. Up to 50 conditions per place. [2024-10-11 17:13:36,197 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-10-11 17:13:36,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 556 transitions, 1151 flow [2024-10-11 17:13:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-10-11 17:13:36,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-10-11 17:13:36,201 INFO L175 Difference]: Start difference. First operand has 551 places, 557 transitions, 1123 flow. Second operand 3 states and 1771 transitions. [2024-10-11 17:13:36,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 556 transitions, 1151 flow [2024-10-11 17:13:36,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 556 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:36,209 INFO L231 Difference]: Finished difference. Result has 551 places, 556 transitions, 1124 flow [2024-10-11 17:13:36,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=549, 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=1124, PETRI_PLACES=551, PETRI_TRANSITIONS=556} [2024-10-11 17:13:36,212 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2024-10-11 17:13:36,212 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 556 transitions, 1124 flow [2024-10-11 17:13:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:36,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:36,213 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:36,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:13:36,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:36,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1654529695, now seen corresponding path program 1 times [2024-10-11 17:13:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031021955] [2024-10-11 17:13:36,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:36,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:36,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031021955] [2024-10-11 17:13:36,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031021955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:36,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:36,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:36,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645518818] [2024-10-11 17:13:36,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:36,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:36,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:36,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:36,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:36,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-10-11 17:13:36,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 556 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:36,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:36,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-10-11 17:13:36,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:36,640 INFO L124 PetriNetUnfolderBase]: 137/2434 cut-off events. [2024-10-11 17:13:36,640 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2024-10-11 17:13:36,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 2434 events. 137/2434 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17650 event pairs, 64 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 2540. Up to 141 conditions per place. [2024-10-11 17:13:36,680 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2024-10-11 17:13:36,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 551 transitions, 1148 flow [2024-10-11 17:13:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-10-11 17:13:36,683 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-10-11 17:13:36,683 INFO L175 Difference]: Start difference. First operand has 551 places, 556 transitions, 1124 flow. Second operand 3 states and 1762 transitions. [2024-10-11 17:13:36,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 551 transitions, 1148 flow [2024-10-11 17:13:36,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 551 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:36,689 INFO L231 Difference]: Finished difference. Result has 546 places, 551 transitions, 1112 flow [2024-10-11 17:13:36,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=546, PETRI_TRANSITIONS=551} [2024-10-11 17:13:36,690 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-10-11 17:13:36,690 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 551 transitions, 1112 flow [2024-10-11 17:13:36,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:36,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:36,692 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:36,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:13:36,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:36,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1674852287, now seen corresponding path program 1 times [2024-10-11 17:13:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162641571] [2024-10-11 17:13:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:36,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-10-11 17:13:36,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162641571] [2024-10-11 17:13:36,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162641571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:36,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:36,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625946297] [2024-10-11 17:13:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:36,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:36,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:36,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:36,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-10-11 17:13:36,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 551 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:36,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:36,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-10-11 17:13:36,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:36,851 INFO L124 PetriNetUnfolderBase]: 39/802 cut-off events. [2024-10-11 17:13:36,852 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-11 17:13:36,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 802 events. 39/802 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2949 event pairs, 20 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 814. Up to 50 conditions per place. [2024-10-11 17:13:36,868 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-10-11 17:13:36,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1140 flow [2024-10-11 17:13:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-10-11 17:13:36,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-10-11 17:13:36,872 INFO L175 Difference]: Start difference. First operand has 546 places, 551 transitions, 1112 flow. Second operand 3 states and 1771 transitions. [2024-10-11 17:13:36,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1140 flow [2024-10-11 17:13:36,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:36,877 INFO L231 Difference]: Finished difference. Result has 546 places, 550 transitions, 1113 flow [2024-10-11 17:13:36,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=546, PETRI_TRANSITIONS=550} [2024-10-11 17:13:36,879 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-10-11 17:13:36,879 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 550 transitions, 1113 flow [2024-10-11 17:13:36,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:36,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:36,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:13:36,881 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:36,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash 721720402, now seen corresponding path program 1 times [2024-10-11 17:13:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:36,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84476110] [2024-10-11 17:13:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84476110] [2024-10-11 17:13:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84476110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:36,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:36,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:36,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50525121] [2024-10-11 17:13:36,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:36,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:36,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:36,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:36,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:36,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-10-11 17:13:36,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 550 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:36,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:36,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-10-11 17:13:36,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:37,035 INFO L124 PetriNetUnfolderBase]: 35/982 cut-off events. [2024-10-11 17:13:37,035 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:13:37,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 982 events. 35/982 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4310 event pairs, 6 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 986. Up to 23 conditions per place. [2024-10-11 17:13:37,047 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-10-11 17:13:37,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 551 transitions, 1145 flow [2024-10-11 17:13:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-10-11 17:13:37,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-10-11 17:13:37,050 INFO L175 Difference]: Start difference. First operand has 546 places, 550 transitions, 1113 flow. Second operand 3 states and 1782 transitions. [2024-10-11 17:13:37,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 551 transitions, 1145 flow [2024-10-11 17:13:37,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:37,057 INFO L231 Difference]: Finished difference. Result has 545 places, 549 transitions, 1111 flow [2024-10-11 17:13:37,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1111, PETRI_PLACES=545, PETRI_TRANSITIONS=549} [2024-10-11 17:13:37,058 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2024-10-11 17:13:37,058 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 549 transitions, 1111 flow [2024-10-11 17:13:37,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:37,059 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:37,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:13:37,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:37,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:37,060 INFO L85 PathProgramCache]: Analyzing trace with hash 199116120, now seen corresponding path program 1 times [2024-10-11 17:13:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:37,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887516909] [2024-10-11 17:13:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887516909] [2024-10-11 17:13:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887516909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:37,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:37,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932993818] [2024-10-11 17:13:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:37,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:37,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:37,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-10-11 17:13:37,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 549 transitions, 1111 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:37,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-10-11 17:13:37,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:37,211 INFO L124 PetriNetUnfolderBase]: 32/868 cut-off events. [2024-10-11 17:13:37,211 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-10-11 17:13:37,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 868 events. 32/868 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3353 event pairs, 6 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 867. Up to 23 conditions per place. [2024-10-11 17:13:37,227 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-10-11 17:13:37,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 550 transitions, 1143 flow [2024-10-11 17:13:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-10-11 17:13:37,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-10-11 17:13:37,229 INFO L175 Difference]: Start difference. First operand has 545 places, 549 transitions, 1111 flow. Second operand 3 states and 1782 transitions. [2024-10-11 17:13:37,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 550 transitions, 1143 flow [2024-10-11 17:13:37,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:37,238 INFO L231 Difference]: Finished difference. Result has 544 places, 548 transitions, 1109 flow [2024-10-11 17:13:37,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=544, PETRI_TRANSITIONS=548} [2024-10-11 17:13:37,239 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-10-11 17:13:37,239 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 548 transitions, 1109 flow [2024-10-11 17:13:37,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:37,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:37,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:13:37,241 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:37,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash -935044885, now seen corresponding path program 1 times [2024-10-11 17:13:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482979976] [2024-10-11 17:13:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482979976] [2024-10-11 17:13:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482979976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:37,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:13:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295670086] [2024-10-11 17:13:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:37,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:37,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:37,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:37,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-10-11 17:13:37,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 548 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:37,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-10-11 17:13:37,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:37,429 INFO L124 PetriNetUnfolderBase]: 41/983 cut-off events. [2024-10-11 17:13:37,430 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-10-11 17:13:37,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 983 events. 41/983 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4257 event pairs, 12 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 1014. Up to 39 conditions per place. [2024-10-11 17:13:37,441 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2024-10-11 17:13:37,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 551 transitions, 1151 flow [2024-10-11 17:13:37,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-10-11 17:13:37,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-10-11 17:13:37,444 INFO L175 Difference]: Start difference. First operand has 544 places, 548 transitions, 1109 flow. Second operand 3 states and 1782 transitions. [2024-10-11 17:13:37,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 551 transitions, 1151 flow [2024-10-11 17:13:37,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:37,454 INFO L231 Difference]: Finished difference. Result has 546 places, 549 transitions, 1123 flow [2024-10-11 17:13:37,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=546, PETRI_TRANSITIONS=549} [2024-10-11 17:13:37,455 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-10-11 17:13:37,455 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 549 transitions, 1123 flow [2024-10-11 17:13:37,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:37,457 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:37,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:13:37,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:37,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 671881940, now seen corresponding path program 1 times [2024-10-11 17:13:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710820368] [2024-10-11 17:13:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710820368] [2024-10-11 17:13:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710820368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:37,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:37,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587255769] [2024-10-11 17:13:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:37,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:37,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:37,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-10-11 17:13:37,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 549 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:37,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-10-11 17:13:37,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:37,642 INFO L124 PetriNetUnfolderBase]: 29/758 cut-off events. [2024-10-11 17:13:37,642 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2024-10-11 17:13:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 758 events. 29/758 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2547 event pairs, 6 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 758. Up to 23 conditions per place. [2024-10-11 17:13:37,652 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-10-11 17:13:37,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1155 flow [2024-10-11 17:13:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-10-11 17:13:37,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-10-11 17:13:37,656 INFO L175 Difference]: Start difference. First operand has 546 places, 549 transitions, 1123 flow. Second operand 3 states and 1782 transitions. [2024-10-11 17:13:37,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1155 flow [2024-10-11 17:13:37,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 550 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:37,665 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1119 flow [2024-10-11 17:13:37,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2024-10-11 17:13:37,666 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2024-10-11 17:13:37,666 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1119 flow [2024-10-11 17:13:37,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:37,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:37,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:13:37,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:37,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1955873248, now seen corresponding path program 1 times [2024-10-11 17:13:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:37,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428898164] [2024-10-11 17:13:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428898164] [2024-10-11 17:13:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428898164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:37,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:37,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:37,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39108996] [2024-10-11 17:13:37,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:37,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:37,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:37,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:37,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-10-11 17:13:37,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1119 flow. Second operand has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:37,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-10-11 17:13:37,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:38,024 INFO L124 PetriNetUnfolderBase]: 86/1557 cut-off events. [2024-10-11 17:13:38,024 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-10-11 17:13:38,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 1557 events. 86/1557 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9007 event pairs, 12 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 1658. Up to 99 conditions per place. [2024-10-11 17:13:38,055 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 20 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-10-11 17:13:38,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 551 transitions, 1174 flow [2024-10-11 17:13:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2024-10-11 17:13:38,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9512325830653805 [2024-10-11 17:13:38,058 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1119 flow. Second operand 3 states and 1775 transitions. [2024-10-11 17:13:38,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 551 transitions, 1174 flow [2024-10-11 17:13:38,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 551 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:38,066 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1121 flow [2024-10-11 17:13:38,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2024-10-11 17:13:38,067 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -35 predicate places. [2024-10-11 17:13:38,067 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1121 flow [2024-10-11 17:13:38,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:38,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:38,069 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:38,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:13:38,069 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:38,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 529790360, now seen corresponding path program 1 times [2024-10-11 17:13:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418367691] [2024-10-11 17:13:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:38,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418367691] [2024-10-11 17:13:38,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418367691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:38,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:38,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:13:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569490523] [2024-10-11 17:13:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:38,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:38,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-10-11 17:13:38,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:38,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:38,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-10-11 17:13:38,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:38,367 INFO L124 PetriNetUnfolderBase]: 65/1229 cut-off events. [2024-10-11 17:13:38,367 INFO L125 PetriNetUnfolderBase]: For 22/85 co-relation queries the response was YES. [2024-10-11 17:13:38,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1229 events. 65/1229 cut-off events. For 22/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6338 event pairs, 18 based on Foata normal form. 2/1092 useless extension candidates. Maximal degree in co-relation 1298. Up to 57 conditions per place. [2024-10-11 17:13:38,389 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/549 dead transitions. [2024-10-11 17:13:38,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 549 transitions, 1163 flow [2024-10-11 17:13:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-10-11 17:13:38,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-10-11 17:13:38,392 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1121 flow. Second operand 3 states and 1782 transitions. [2024-10-11 17:13:38,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 549 transitions, 1163 flow [2024-10-11 17:13:38,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 549 transitions, 1163 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:38,399 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1139 flow [2024-10-11 17:13:38,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2024-10-11 17:13:38,400 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-10-11 17:13:38,400 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1139 flow [2024-10-11 17:13:38,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:38,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:38,403 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:38,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:13:38,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:38,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash -299923418, now seen corresponding path program 1 times [2024-10-11 17:13:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:38,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19260561] [2024-10-11 17:13:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19260561] [2024-10-11 17:13:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19260561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:38,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847235801] [2024-10-11 17:13:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:38,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:38,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:38,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-10-11 17:13:38,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:38,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:38,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-10-11 17:13:38,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:38,925 INFO L124 PetriNetUnfolderBase]: 157/2691 cut-off events. [2024-10-11 17:13:38,925 INFO L125 PetriNetUnfolderBase]: For 27/41 co-relation queries the response was YES. [2024-10-11 17:13:38,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3027 conditions, 2691 events. 157/2691 cut-off events. For 27/41 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 19534 event pairs, 31 based on Foata normal form. 1/2408 useless extension candidates. Maximal degree in co-relation 2975. Up to 161 conditions per place. [2024-10-11 17:13:38,972 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 20 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-10-11 17:13:38,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 550 transitions, 1194 flow [2024-10-11 17:13:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2024-10-11 17:13:38,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9512325830653805 [2024-10-11 17:13:38,975 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1139 flow. Second operand 3 states and 1775 transitions. [2024-10-11 17:13:38,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 550 transitions, 1194 flow [2024-10-11 17:13:38,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 550 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:38,983 INFO L231 Difference]: Finished difference. Result has 543 places, 545 transitions, 1139 flow [2024-10-11 17:13:38,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=543, PETRI_TRANSITIONS=545} [2024-10-11 17:13:38,984 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -34 predicate places. [2024-10-11 17:13:38,984 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 545 transitions, 1139 flow [2024-10-11 17:13:38,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:38,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:38,985 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:38,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:13:38,985 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:38,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1776415780, now seen corresponding path program 1 times [2024-10-11 17:13:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:38,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575816199] [2024-10-11 17:13:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:39,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575816199] [2024-10-11 17:13:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575816199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:39,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953272773] [2024-10-11 17:13:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:39,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:39,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:39,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:39,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-10-11 17:13:39,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 545 transitions, 1139 flow. Second operand has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:39,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:39,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-10-11 17:13:39,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:39,950 INFO L124 PetriNetUnfolderBase]: 124/1863 cut-off events. [2024-10-11 17:13:39,950 INFO L125 PetriNetUnfolderBase]: For 10/60 co-relation queries the response was YES. [2024-10-11 17:13:39,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1863 events. 124/1863 cut-off events. For 10/60 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 11049 event pairs, 35 based on Foata normal form. 9/1720 useless extension candidates. Maximal degree in co-relation 2268. Up to 146 conditions per place. [2024-10-11 17:13:39,978 INFO L140 encePairwiseOnDemand]: 606/622 looper letters, 68 selfloop transitions, 18 changer transitions 0/585 dead transitions. [2024-10-11 17:13:39,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 585 transitions, 1409 flow [2024-10-11 17:13:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:13:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 17:13:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6771 transitions. [2024-10-11 17:13:39,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071543408360129 [2024-10-11 17:13:39,987 INFO L175 Difference]: Start difference. First operand has 543 places, 545 transitions, 1139 flow. Second operand 12 states and 6771 transitions. [2024-10-11 17:13:39,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 585 transitions, 1409 flow [2024-10-11 17:13:39,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 585 transitions, 1409 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:39,995 INFO L231 Difference]: Finished difference. Result has 560 places, 554 transitions, 1232 flow [2024-10-11 17:13:39,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1232, PETRI_PLACES=560, PETRI_TRANSITIONS=554} [2024-10-11 17:13:39,996 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -17 predicate places. [2024-10-11 17:13:39,996 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 554 transitions, 1232 flow [2024-10-11 17:13:39,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:39,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:39,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:39,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:13:39,997 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2061709046, now seen corresponding path program 1 times [2024-10-11 17:13:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367122232] [2024-10-11 17:13:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367122232] [2024-10-11 17:13:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367122232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107488231] [2024-10-11 17:13:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:40,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-10-11 17:13:40,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 554 transitions, 1232 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:40,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:40,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-10-11 17:13:40,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:41,418 INFO L124 PetriNetUnfolderBase]: 276/3727 cut-off events. [2024-10-11 17:13:41,419 INFO L125 PetriNetUnfolderBase]: For 164/284 co-relation queries the response was YES. [2024-10-11 17:13:41,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 3727 events. 276/3727 cut-off events. For 164/284 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 31374 event pairs, 98 based on Foata normal form. 8/3375 useless extension candidates. Maximal degree in co-relation 4566. Up to 314 conditions per place. [2024-10-11 17:13:41,484 INFO L140 encePairwiseOnDemand]: 608/622 looper letters, 65 selfloop transitions, 15 changer transitions 0/583 dead transitions. [2024-10-11 17:13:41,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 583 transitions, 1466 flow [2024-10-11 17:13:41,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6202 transitions. [2024-10-11 17:13:41,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9064600993861444 [2024-10-11 17:13:41,498 INFO L175 Difference]: Start difference. First operand has 560 places, 554 transitions, 1232 flow. Second operand 11 states and 6202 transitions. [2024-10-11 17:13:41,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 583 transitions, 1466 flow [2024-10-11 17:13:41,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 583 transitions, 1466 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:41,506 INFO L231 Difference]: Finished difference. Result has 575 places, 562 transitions, 1308 flow [2024-10-11 17:13:41,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=560, 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=1308, PETRI_PLACES=575, PETRI_TRANSITIONS=562} [2024-10-11 17:13:41,507 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -2 predicate places. [2024-10-11 17:13:41,507 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 562 transitions, 1308 flow [2024-10-11 17:13:41,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:41,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:41,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:41,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:13:41,509 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1249250259, now seen corresponding path program 1 times [2024-10-11 17:13:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:41,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600514838] [2024-10-11 17:13:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600514838] [2024-10-11 17:13:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600514838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:13:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469108154] [2024-10-11 17:13:41,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:41,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:41,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:41,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:41,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-10-11 17:13:41,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 562 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:41,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:41,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-10-11 17:13:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:42,186 INFO L124 PetriNetUnfolderBase]: 355/3156 cut-off events. [2024-10-11 17:13:42,186 INFO L125 PetriNetUnfolderBase]: For 287/358 co-relation queries the response was YES. [2024-10-11 17:13:42,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 3156 events. 355/3156 cut-off events. For 287/358 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 25530 event pairs, 144 based on Foata normal form. 0/2804 useless extension candidates. Maximal degree in co-relation 4000. Up to 419 conditions per place. [2024-10-11 17:13:42,232 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2024-10-11 17:13:42,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 565 transitions, 1350 flow [2024-10-11 17:13:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-10-11 17:13:42,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-10-11 17:13:42,236 INFO L175 Difference]: Start difference. First operand has 575 places, 562 transitions, 1308 flow. Second operand 3 states and 1782 transitions. [2024-10-11 17:13:42,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 565 transitions, 1350 flow [2024-10-11 17:13:42,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 565 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:42,244 INFO L231 Difference]: Finished difference. Result has 578 places, 563 transitions, 1322 flow [2024-10-11 17:13:42,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=574, 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=1322, PETRI_PLACES=578, PETRI_TRANSITIONS=563} [2024-10-11 17:13:42,245 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 1 predicate places. [2024-10-11 17:13:42,245 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 563 transitions, 1322 flow [2024-10-11 17:13:42,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:42,245 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:42,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:13:42,246 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:42,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:42,246 INFO L85 PathProgramCache]: Analyzing trace with hash -252452634, now seen corresponding path program 1 times [2024-10-11 17:13:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654010848] [2024-10-11 17:13:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:42,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:42,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654010848] [2024-10-11 17:13:42,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654010848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:42,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:42,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:42,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869581356] [2024-10-11 17:13:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:42,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:42,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-10-11 17:13:42,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 563 transitions, 1322 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:42,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-10-11 17:13:42,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,384 INFO L124 PetriNetUnfolderBase]: 296/3358 cut-off events. [2024-10-11 17:13:43,384 INFO L125 PetriNetUnfolderBase]: For 339/371 co-relation queries the response was YES. [2024-10-11 17:13:43,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 3358 events. 296/3358 cut-off events. For 339/371 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26170 event pairs, 106 based on Foata normal form. 7/3076 useless extension candidates. Maximal degree in co-relation 4378. Up to 362 conditions per place. [2024-10-11 17:13:43,432 INFO L140 encePairwiseOnDemand]: 606/622 looper letters, 78 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2024-10-11 17:13:43,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 603 transitions, 1646 flow [2024-10-11 17:13:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:13:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 17:13:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6771 transitions. [2024-10-11 17:13:43,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071543408360129 [2024-10-11 17:13:43,442 INFO L175 Difference]: Start difference. First operand has 578 places, 563 transitions, 1322 flow. Second operand 12 states and 6771 transitions. [2024-10-11 17:13:43,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 603 transitions, 1646 flow [2024-10-11 17:13:43,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 603 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:43,452 INFO L231 Difference]: Finished difference. Result has 591 places, 567 transitions, 1388 flow [2024-10-11 17:13:43,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1388, PETRI_PLACES=591, PETRI_TRANSITIONS=567} [2024-10-11 17:13:43,453 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 14 predicate places. [2024-10-11 17:13:43,453 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 567 transitions, 1388 flow [2024-10-11 17:13:43,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:43,454 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:43,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:13:43,454 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -695808414, now seen corresponding path program 1 times [2024-10-11 17:13:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774993051] [2024-10-11 17:13:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774993051] [2024-10-11 17:13:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774993051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801353831] [2024-10-11 17:13:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:44,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-10-11 17:13:44,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 567 transitions, 1388 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-10-11 17:13:44,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:44,671 INFO L124 PetriNetUnfolderBase]: 162/2639 cut-off events. [2024-10-11 17:13:44,671 INFO L125 PetriNetUnfolderBase]: For 241/311 co-relation queries the response was YES. [2024-10-11 17:13:44,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 2639 events. 162/2639 cut-off events. For 241/311 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 17676 event pairs, 65 based on Foata normal form. 6/2479 useless extension candidates. Maximal degree in co-relation 3610. Up to 234 conditions per place. [2024-10-11 17:13:44,710 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 72 selfloop transitions, 19 changer transitions 0/598 dead transitions. [2024-10-11 17:13:44,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 598 transitions, 1683 flow [2024-10-11 17:13:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6204 transitions. [2024-10-11 17:13:44,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9067524115755627 [2024-10-11 17:13:44,719 INFO L175 Difference]: Start difference. First operand has 591 places, 567 transitions, 1388 flow. Second operand 11 states and 6204 transitions. [2024-10-11 17:13:44,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 598 transitions, 1683 flow [2024-10-11 17:13:44,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 598 transitions, 1666 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:13:44,729 INFO L231 Difference]: Finished difference. Result has 598 places, 574 transitions, 1482 flow [2024-10-11 17:13:44,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=598, PETRI_TRANSITIONS=574} [2024-10-11 17:13:44,730 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-10-11 17:13:44,730 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 574 transitions, 1482 flow [2024-10-11 17:13:44,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:13:44,731 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:44,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -813334789, now seen corresponding path program 1 times [2024-10-11 17:13:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226191171] [2024-10-11 17:13:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:44,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226191171] [2024-10-11 17:13:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226191171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137826413] [2024-10-11 17:13:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:44,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:45,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-10-11 17:13:45,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 574 transitions, 1482 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:45,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:45,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-10-11 17:13:45,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:46,085 INFO L124 PetriNetUnfolderBase]: 311/3814 cut-off events. [2024-10-11 17:13:46,085 INFO L125 PetriNetUnfolderBase]: For 549/661 co-relation queries the response was YES. [2024-10-11 17:13:46,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 3814 events. 311/3814 cut-off events. For 549/661 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 31483 event pairs, 112 based on Foata normal form. 4/3537 useless extension candidates. Maximal degree in co-relation 5321. Up to 387 conditions per place. [2024-10-11 17:13:46,133 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 67 selfloop transitions, 18 changer transitions 0/600 dead transitions. [2024-10-11 17:13:46,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 600 transitions, 1744 flow [2024-10-11 17:13:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6195 transitions. [2024-10-11 17:13:46,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054370067231804 [2024-10-11 17:13:46,137 INFO L175 Difference]: Start difference. First operand has 598 places, 574 transitions, 1482 flow. Second operand 11 states and 6195 transitions. [2024-10-11 17:13:46,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 600 transitions, 1744 flow [2024-10-11 17:13:46,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 600 transitions, 1723 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 17:13:46,146 INFO L231 Difference]: Finished difference. Result has 606 places, 585 transitions, 1577 flow [2024-10-11 17:13:46,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1577, PETRI_PLACES=606, PETRI_TRANSITIONS=585} [2024-10-11 17:13:46,147 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 29 predicate places. [2024-10-11 17:13:46,147 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 585 transitions, 1577 flow [2024-10-11 17:13:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:46,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:46,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:46,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:13:46,149 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:46,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash -555921884, now seen corresponding path program 1 times [2024-10-11 17:13:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046873030] [2024-10-11 17:13:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046873030] [2024-10-11 17:13:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046873030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:46,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058666508] [2024-10-11 17:13:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:46,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:46,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-10-11 17:13:46,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 585 transitions, 1577 flow. Second operand has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:46,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:46,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-10-11 17:13:46,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:47,262 INFO L124 PetriNetUnfolderBase]: 335/3802 cut-off events. [2024-10-11 17:13:47,262 INFO L125 PetriNetUnfolderBase]: For 795/835 co-relation queries the response was YES. [2024-10-11 17:13:47,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5553 conditions, 3802 events. 335/3802 cut-off events. For 795/835 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 30519 event pairs, 138 based on Foata normal form. 8/3541 useless extension candidates. Maximal degree in co-relation 5459. Up to 483 conditions per place. [2024-10-11 17:13:47,313 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 68 selfloop transitions, 19 changer transitions 0/607 dead transitions. [2024-10-11 17:13:47,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 607 transitions, 1846 flow [2024-10-11 17:13:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6195 transitions. [2024-10-11 17:13:47,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054370067231804 [2024-10-11 17:13:47,317 INFO L175 Difference]: Start difference. First operand has 606 places, 585 transitions, 1577 flow. Second operand 11 states and 6195 transitions. [2024-10-11 17:13:47,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 607 transitions, 1846 flow [2024-10-11 17:13:47,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 607 transitions, 1842 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:47,326 INFO L231 Difference]: Finished difference. Result has 618 places, 592 transitions, 1684 flow [2024-10-11 17:13:47,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1684, PETRI_PLACES=618, PETRI_TRANSITIONS=592} [2024-10-11 17:13:47,327 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 41 predicate places. [2024-10-11 17:13:47,327 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 592 transitions, 1684 flow [2024-10-11 17:13:47,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:47,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:47,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:13:47,328 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:47,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1287926569, now seen corresponding path program 1 times [2024-10-11 17:13:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917117495] [2024-10-11 17:13:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917117495] [2024-10-11 17:13:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917117495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:47,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:47,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257140333] [2024-10-11 17:13:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:47,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:48,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-10-11 17:13:48,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 592 transitions, 1684 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:48,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:48,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-10-11 17:13:48,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:48,549 INFO L124 PetriNetUnfolderBase]: 183/3420 cut-off events. [2024-10-11 17:13:48,549 INFO L125 PetriNetUnfolderBase]: For 774/798 co-relation queries the response was YES. [2024-10-11 17:13:48,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 3420 events. 183/3420 cut-off events. For 774/798 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 24515 event pairs, 23 based on Foata normal form. 4/3236 useless extension candidates. Maximal degree in co-relation 4961. Up to 177 conditions per place. [2024-10-11 17:13:48,597 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 41 selfloop transitions, 5 changer transitions 0/601 dead transitions. [2024-10-11 17:13:48,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 601 transitions, 1805 flow [2024-10-11 17:13:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2024-10-11 17:13:48,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252411575562701 [2024-10-11 17:13:48,599 INFO L175 Difference]: Start difference. First operand has 618 places, 592 transitions, 1684 flow. Second operand 6 states and 3453 transitions. [2024-10-11 17:13:48,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 601 transitions, 1805 flow [2024-10-11 17:13:48,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 601 transitions, 1784 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 17:13:48,609 INFO L231 Difference]: Finished difference. Result has 614 places, 590 transitions, 1669 flow [2024-10-11 17:13:48,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1669, PETRI_PLACES=614, PETRI_TRANSITIONS=590} [2024-10-11 17:13:48,610 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 37 predicate places. [2024-10-11 17:13:48,610 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 590 transitions, 1669 flow [2024-10-11 17:13:48,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:48,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:48,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:48,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:13:48,611 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -217058218, now seen corresponding path program 1 times [2024-10-11 17:13:48,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:48,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437704392] [2024-10-11 17:13:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:48,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437704392] [2024-10-11 17:13:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437704392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:48,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:48,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:48,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069896019] [2024-10-11 17:13:48,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:48,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:48,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:48,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:49,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-10-11 17:13:49,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 590 transitions, 1669 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:49,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:49,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-10-11 17:13:49,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:49,920 INFO L124 PetriNetUnfolderBase]: 189/3708 cut-off events. [2024-10-11 17:13:49,920 INFO L125 PetriNetUnfolderBase]: For 770/830 co-relation queries the response was YES. [2024-10-11 17:13:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3708 events. 189/3708 cut-off events. For 770/830 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27383 event pairs, 28 based on Foata normal form. 4/3471 useless extension candidates. Maximal degree in co-relation 5154. Up to 195 conditions per place. [2024-10-11 17:13:49,984 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 40 selfloop transitions, 5 changer transitions 0/598 dead transitions. [2024-10-11 17:13:49,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 598 transitions, 1785 flow [2024-10-11 17:13:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2024-10-11 17:13:49,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.92497320471597 [2024-10-11 17:13:49,986 INFO L175 Difference]: Start difference. First operand has 614 places, 590 transitions, 1669 flow. Second operand 6 states and 3452 transitions. [2024-10-11 17:13:49,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 598 transitions, 1785 flow [2024-10-11 17:13:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 598 transitions, 1775 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:49,998 INFO L231 Difference]: Finished difference. Result has 612 places, 588 transitions, 1665 flow [2024-10-11 17:13:49,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1655, 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=1665, PETRI_PLACES=612, PETRI_TRANSITIONS=588} [2024-10-11 17:13:49,998 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 35 predicate places. [2024-10-11 17:13:49,999 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 588 transitions, 1665 flow [2024-10-11 17:13:49,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:49,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:49,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:50,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:13:50,000 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1624233987, now seen corresponding path program 1 times [2024-10-11 17:13:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:50,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90911706] [2024-10-11 17:13:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:50,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:50,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90911706] [2024-10-11 17:13:50,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90911706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:50,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971322378] [2024-10-11 17:13:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:50,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:50,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-10-11 17:13:50,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 588 transitions, 1665 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:50,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:50,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-10-11 17:13:50,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:51,280 INFO L124 PetriNetUnfolderBase]: 168/3451 cut-off events. [2024-10-11 17:13:51,280 INFO L125 PetriNetUnfolderBase]: For 751/823 co-relation queries the response was YES. [2024-10-11 17:13:51,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5006 conditions, 3451 events. 168/3451 cut-off events. For 751/823 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 24889 event pairs, 23 based on Foata normal form. 4/3270 useless extension candidates. Maximal degree in co-relation 4909. Up to 187 conditions per place. [2024-10-11 17:13:51,327 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 41 selfloop transitions, 5 changer transitions 0/597 dead transitions. [2024-10-11 17:13:51,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 597 transitions, 1786 flow [2024-10-11 17:13:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2024-10-11 17:13:51,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252411575562701 [2024-10-11 17:13:51,330 INFO L175 Difference]: Start difference. First operand has 612 places, 588 transitions, 1665 flow. Second operand 6 states and 3453 transitions. [2024-10-11 17:13:51,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 597 transitions, 1786 flow [2024-10-11 17:13:51,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 597 transitions, 1776 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:51,342 INFO L231 Difference]: Finished difference. Result has 610 places, 586 transitions, 1661 flow [2024-10-11 17:13:51,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1651, 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=1661, PETRI_PLACES=610, PETRI_TRANSITIONS=586} [2024-10-11 17:13:51,344 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 33 predicate places. [2024-10-11 17:13:51,344 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 586 transitions, 1661 flow [2024-10-11 17:13:51,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:51,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:51,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:51,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:13:51,345 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1860500184, now seen corresponding path program 1 times [2024-10-11 17:13:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:51,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913469487] [2024-10-11 17:13:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:51,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:51,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913469487] [2024-10-11 17:13:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913469487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:51,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:51,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994927144] [2024-10-11 17:13:51,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:51,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:51,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-10-11 17:13:51,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 586 transitions, 1661 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:51,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:51,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-10-11 17:13:51,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:52,499 INFO L124 PetriNetUnfolderBase]: 461/6869 cut-off events. [2024-10-11 17:13:52,500 INFO L125 PetriNetUnfolderBase]: For 823/857 co-relation queries the response was YES. [2024-10-11 17:13:52,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8854 conditions, 6869 events. 461/6869 cut-off events. For 823/857 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 62328 event pairs, 66 based on Foata normal form. 0/6333 useless extension candidates. Maximal degree in co-relation 8758. Up to 487 conditions per place. [2024-10-11 17:13:52,611 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 19 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2024-10-11 17:13:52,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 588 transitions, 1711 flow [2024-10-11 17:13:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1774 transitions. [2024-10-11 17:13:52,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9506966773847803 [2024-10-11 17:13:52,612 INFO L175 Difference]: Start difference. First operand has 610 places, 586 transitions, 1661 flow. Second operand 3 states and 1774 transitions. [2024-10-11 17:13:52,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 588 transitions, 1711 flow [2024-10-11 17:13:52,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 588 transitions, 1701 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:52,625 INFO L231 Difference]: Finished difference. Result has 604 places, 584 transitions, 1657 flow [2024-10-11 17:13:52,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1657, PETRI_PLACES=604, PETRI_TRANSITIONS=584} [2024-10-11 17:13:52,626 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2024-10-11 17:13:52,626 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 584 transitions, 1657 flow [2024-10-11 17:13:52,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:52,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:52,626 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:52,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:13:52,626 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:52,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1631774597, now seen corresponding path program 1 times [2024-10-11 17:13:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729036498] [2024-10-11 17:13:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729036498] [2024-10-11 17:13:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729036498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587739322] [2024-10-11 17:13:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:52,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:52,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:53,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-10-11 17:13:53,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 584 transitions, 1657 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:53,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:53,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-10-11 17:13:53,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:53,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][477], [201#L79-4true, Black: 831#true, Black: 701#(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|)), 662#true, Black: 699#(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|)), 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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)), 837#(= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~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)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 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)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:53,945 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-10-11 17:13:53,945 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-10-11 17:13:53,945 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-10-11 17:13:53,945 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-10-11 17:13:53,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][481], [Black: 831#true, Black: 701#(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|)), 662#true, Black: 699#(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|)), 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 838#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 162#L79-5true, 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~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)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 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)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:53,952 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-10-11 17:13:53,952 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-10-11 17:13:53,952 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-10-11 17:13:53,952 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-10-11 17:13:53,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][485], [Black: 831#true, Black: 701#(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|)), 662#true, Black: 699#(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: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 314#L104true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), 839#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~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)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 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)), 150#L79-6true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:53,957 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-10-11 17:13:53,957 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-10-11 17:13:53,957 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-10-11 17:13:53,957 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-10-11 17:13:53,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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: 831#true, Black: 701#(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|)), 662#true, 314#L104true, Black: 699#(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: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 778#(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: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~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)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 125#L79-7true, 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)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:53,962 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-10-11 17:13:53,962 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-10-11 17:13:53,962 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-10-11 17:13:53,962 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-10-11 17:13:53,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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: 831#true, Black: 701#(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|)), 662#true, Black: 699#(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|)), 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 376#L79-8true, Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 778#(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: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~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)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 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)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:53,966 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-11 17:13:53,966 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-10-11 17:13:53,966 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-10-11 17:13:53,966 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-10-11 17:13:54,043 INFO L124 PetriNetUnfolderBase]: 320/4336 cut-off events. [2024-10-11 17:13:54,043 INFO L125 PetriNetUnfolderBase]: For 1094/1127 co-relation queries the response was YES. [2024-10-11 17:13:54,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 4336 events. 320/4336 cut-off events. For 1094/1127 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 35854 event pairs, 38 based on Foata normal form. 4/4120 useless extension candidates. Maximal degree in co-relation 6236. Up to 229 conditions per place. [2024-10-11 17:13:54,105 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 39 selfloop transitions, 5 changer transitions 0/591 dead transitions. [2024-10-11 17:13:54,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 591 transitions, 1768 flow [2024-10-11 17:13:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2024-10-11 17:13:54,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9247052518756699 [2024-10-11 17:13:54,107 INFO L175 Difference]: Start difference. First operand has 604 places, 584 transitions, 1657 flow. Second operand 6 states and 3451 transitions. [2024-10-11 17:13:54,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 591 transitions, 1768 flow [2024-10-11 17:13:54,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 591 transitions, 1768 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:54,118 INFO L231 Difference]: Finished difference. Result has 607 places, 582 transitions, 1663 flow [2024-10-11 17:13:54,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1663, PETRI_PLACES=607, PETRI_TRANSITIONS=582} [2024-10-11 17:13:54,119 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 30 predicate places. [2024-10-11 17:13:54,119 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 582 transitions, 1663 flow [2024-10-11 17:13:54,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:54,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:54,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:13:54,120 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:54,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash -29619716, now seen corresponding path program 1 times [2024-10-11 17:13:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944876814] [2024-10-11 17:13:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944876814] [2024-10-11 17:13:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944876814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509004287] [2024-10-11 17:13:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:54,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-10-11 17:13:54,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 582 transitions, 1663 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:54,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-10-11 17:13:54,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][334], [Black: 831#true, 456#L105true, Black: 701#(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|)), 662#true, Black: 699#(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: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 658#true, Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 835#true, 841#true, 651#(= |#race~a1~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)), 631#(= |#race~n3~0| 0), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 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)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:55,379 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-10-11 17:13:55,379 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-10-11 17:13:55,379 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-10-11 17:13:55,379 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-10-11 17:13:55,416 INFO L124 PetriNetUnfolderBase]: 204/4117 cut-off events. [2024-10-11 17:13:55,417 INFO L125 PetriNetUnfolderBase]: For 784/898 co-relation queries the response was YES. [2024-10-11 17:13:55,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 4117 events. 204/4117 cut-off events. For 784/898 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 32102 event pairs, 30 based on Foata normal form. 11/3924 useless extension candidates. Maximal degree in co-relation 5699. Up to 194 conditions per place. [2024-10-11 17:13:55,483 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 40 selfloop transitions, 5 changer transitions 0/590 dead transitions. [2024-10-11 17:13:55,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 590 transitions, 1779 flow [2024-10-11 17:13:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2024-10-11 17:13:55,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.92497320471597 [2024-10-11 17:13:55,485 INFO L175 Difference]: Start difference. First operand has 607 places, 582 transitions, 1663 flow. Second operand 6 states and 3452 transitions. [2024-10-11 17:13:55,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 590 transitions, 1779 flow [2024-10-11 17:13:55,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 590 transitions, 1769 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:55,495 INFO L231 Difference]: Finished difference. Result has 605 places, 580 transitions, 1659 flow [2024-10-11 17:13:55,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1659, PETRI_PLACES=605, PETRI_TRANSITIONS=580} [2024-10-11 17:13:55,495 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 28 predicate places. [2024-10-11 17:13:55,496 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 580 transitions, 1659 flow [2024-10-11 17:13:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:55,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:13:55,496 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:55,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 668239048, now seen corresponding path program 1 times [2024-10-11 17:13:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618069571] [2024-10-11 17:13:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618069571] [2024-10-11 17:13:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618069571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400230090] [2024-10-11 17:13:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-10-11 17:13:55,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 580 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:55,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-10-11 17:13:55,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:56,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][334], [Black: 831#true, 456#L105true, 662#true, Black: 701#(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: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(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: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 658#true, Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 847#true, Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), 841#true, 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)), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 631#(= |#race~n3~0| 0), Black: 795#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 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)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:56,061 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-10-11 17:13:56,061 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-10-11 17:13:56,061 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-10-11 17:13:56,061 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-10-11 17:13:56,127 INFO L124 PetriNetUnfolderBase]: 160/4200 cut-off events. [2024-10-11 17:13:56,127 INFO L125 PetriNetUnfolderBase]: For 740/780 co-relation queries the response was YES. [2024-10-11 17:13:56,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5771 conditions, 4200 events. 160/4200 cut-off events. For 740/780 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 30987 event pairs, 27 based on Foata normal form. 0/4030 useless extension candidates. Maximal degree in co-relation 5674. Up to 132 conditions per place. [2024-10-11 17:13:56,185 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 9 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2024-10-11 17:13:56,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 579 transitions, 1677 flow [2024-10-11 17:13:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-10-11 17:13:56,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2024-10-11 17:13:56,187 INFO L175 Difference]: Start difference. First operand has 605 places, 580 transitions, 1659 flow. Second operand 3 states and 1784 transitions. [2024-10-11 17:13:56,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 579 transitions, 1677 flow [2024-10-11 17:13:56,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 579 transitions, 1667 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:56,196 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1649 flow [2024-10-11 17:13:56,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1647, 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=1649, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2024-10-11 17:13:56,197 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 24 predicate places. [2024-10-11 17:13:56,197 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1649 flow [2024-10-11 17:13:56,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:56,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:56,197 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:56,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:13:56,197 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2135423061, now seen corresponding path program 1 times [2024-10-11 17:13:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842767879] [2024-10-11 17:13:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:56,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:56,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842767879] [2024-10-11 17:13:56,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842767879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:56,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297350772] [2024-10-11 17:13:56,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:56,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:56,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:56,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:56,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:56,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-10-11 17:13:56,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1649 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:56,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:56,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-10-11 17:13:56,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:57,522 INFO L124 PetriNetUnfolderBase]: 270/4234 cut-off events. [2024-10-11 17:13:57,522 INFO L125 PetriNetUnfolderBase]: For 1044/1072 co-relation queries the response was YES. [2024-10-11 17:13:57,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 4234 events. 270/4234 cut-off events. For 1044/1072 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 34090 event pairs, 38 based on Foata normal form. 0/4081 useless extension candidates. Maximal degree in co-relation 6048. Up to 214 conditions per place. [2024-10-11 17:13:57,581 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 39 selfloop transitions, 5 changer transitions 0/586 dead transitions. [2024-10-11 17:13:57,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 586 transitions, 1760 flow [2024-10-11 17:13:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2024-10-11 17:13:57,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9247052518756699 [2024-10-11 17:13:57,583 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1649 flow. Second operand 6 states and 3451 transitions. [2024-10-11 17:13:57,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 586 transitions, 1760 flow [2024-10-11 17:13:57,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 586 transitions, 1759 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:57,594 INFO L231 Difference]: Finished difference. Result has 603 places, 577 transitions, 1654 flow [2024-10-11 17:13:57,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1654, PETRI_PLACES=603, PETRI_TRANSITIONS=577} [2024-10-11 17:13:57,595 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 26 predicate places. [2024-10-11 17:13:57,595 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 577 transitions, 1654 flow [2024-10-11 17:13:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:57,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:57,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:57,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:13:57,596 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:57,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1991993737, now seen corresponding path program 1 times [2024-10-11 17:13:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:57,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430061704] [2024-10-11 17:13:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:57,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430061704] [2024-10-11 17:13:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430061704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975626558] [2024-10-11 17:13:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:57,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:57,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:57,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:57,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:57,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-10-11 17:13:57,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 577 transitions, 1654 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:57,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:57,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-10-11 17:13:57,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:58,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][334], [Black: 831#true, 456#L105true, 662#true, Black: 701#(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: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(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: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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: 776#(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: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 658#true, Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 850#true, Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~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)), 631#(= |#race~n3~0| 0), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 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)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 856#true, Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:58,116 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-10-11 17:13:58,116 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-10-11 17:13:58,116 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-10-11 17:13:58,117 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-10-11 17:13:58,171 INFO L124 PetriNetUnfolderBase]: 122/3730 cut-off events. [2024-10-11 17:13:58,171 INFO L125 PetriNetUnfolderBase]: For 635/702 co-relation queries the response was YES. [2024-10-11 17:13:58,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5146 conditions, 3730 events. 122/3730 cut-off events. For 635/702 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 27107 event pairs, 30 based on Foata normal form. 0/3613 useless extension candidates. Maximal degree in co-relation 5049. Up to 129 conditions per place. [2024-10-11 17:13:58,231 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 9 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2024-10-11 17:13:58,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 576 transitions, 1672 flow [2024-10-11 17:13:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-10-11 17:13:58,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2024-10-11 17:13:58,232 INFO L175 Difference]: Start difference. First operand has 603 places, 577 transitions, 1654 flow. Second operand 3 states and 1784 transitions. [2024-10-11 17:13:58,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 576 transitions, 1672 flow [2024-10-11 17:13:58,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 576 transitions, 1662 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:58,242 INFO L231 Difference]: Finished difference. Result has 599 places, 576 transitions, 1644 flow [2024-10-11 17:13:58,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1644, PETRI_PLACES=599, PETRI_TRANSITIONS=576} [2024-10-11 17:13:58,243 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 22 predicate places. [2024-10-11 17:13:58,243 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 576 transitions, 1644 flow [2024-10-11 17:13:58,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:58,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:58,243 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:58,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:13:58,243 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:58,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1325481753, now seen corresponding path program 1 times [2024-10-11 17:13:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436354368] [2024-10-11 17:13:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:58,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436354368] [2024-10-11 17:13:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436354368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:58,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:58,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:58,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622682319] [2024-10-11 17:13:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:58,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:58,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:58,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:58,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-10-11 17:13:58,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 576 transitions, 1644 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:58,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:58,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-10-11 17:13:58,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:58,729 INFO L124 PetriNetUnfolderBase]: 133/3239 cut-off events. [2024-10-11 17:13:58,729 INFO L125 PetriNetUnfolderBase]: For 525/564 co-relation queries the response was YES. [2024-10-11 17:13:58,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4443 conditions, 3239 events. 133/3239 cut-off events. For 525/564 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22461 event pairs, 39 based on Foata normal form. 30/3165 useless extension candidates. Maximal degree in co-relation 4346. Up to 154 conditions per place. [2024-10-11 17:13:58,772 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 7 selfloop transitions, 0 changer transitions 20/575 dead transitions. [2024-10-11 17:13:58,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 575 transitions, 1660 flow [2024-10-11 17:13:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-10-11 17:13:58,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2024-10-11 17:13:58,773 INFO L175 Difference]: Start difference. First operand has 599 places, 576 transitions, 1644 flow. Second operand 3 states and 1783 transitions. [2024-10-11 17:13:58,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 575 transitions, 1660 flow [2024-10-11 17:13:58,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 575 transitions, 1659 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:58,782 INFO L231 Difference]: Finished difference. Result has 599 places, 555 transitions, 1528 flow [2024-10-11 17:13:58,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=599, PETRI_TRANSITIONS=555} [2024-10-11 17:13:58,782 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 22 predicate places. [2024-10-11 17:13:58,782 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 555 transitions, 1528 flow [2024-10-11 17:13:58,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:58,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:58,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:58,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:13:58,783 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:58,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:58,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1051946790, now seen corresponding path program 1 times [2024-10-11 17:13:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:58,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705599679] [2024-10-11 17:13:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:58,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705599679] [2024-10-11 17:13:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705599679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563678495] [2024-10-11 17:13:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:58,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:58,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-10-11 17:13:58,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 555 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:58,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:58,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-10-11 17:13:58,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:59,391 INFO L124 PetriNetUnfolderBase]: 155/3721 cut-off events. [2024-10-11 17:13:59,391 INFO L125 PetriNetUnfolderBase]: For 537/557 co-relation queries the response was YES. [2024-10-11 17:13:59,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 3721 events. 155/3721 cut-off events. For 537/557 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 25093 event pairs, 25 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5037. Up to 107 conditions per place. [2024-10-11 17:13:59,423 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 10 selfloop transitions, 2 changer transitions 12/556 dead transitions. [2024-10-11 17:13:59,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 556 transitions, 1556 flow [2024-10-11 17:13:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-10-11 17:13:59,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-10-11 17:13:59,424 INFO L175 Difference]: Start difference. First operand has 599 places, 555 transitions, 1528 flow. Second operand 3 states and 1780 transitions. [2024-10-11 17:13:59,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 556 transitions, 1556 flow [2024-10-11 17:13:59,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 556 transitions, 1544 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:59,433 INFO L231 Difference]: Finished difference. Result has 586 places, 542 transitions, 1430 flow [2024-10-11 17:13:59,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=584, 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=1430, PETRI_PLACES=586, PETRI_TRANSITIONS=542} [2024-10-11 17:13:59,434 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 9 predicate places. [2024-10-11 17:13:59,434 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 542 transitions, 1430 flow [2024-10-11 17:13:59,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:59,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:59,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:59,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 17:13:59,435 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:59,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash -257600146, now seen corresponding path program 1 times [2024-10-11 17:13:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:59,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66530771] [2024-10-11 17:13:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:59,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66530771] [2024-10-11 17:13:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66530771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:59,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:59,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:59,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083288823] [2024-10-11 17:13:59,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:59,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:59,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:59,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:59,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:59,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-10-11 17:13:59,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 542 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:59,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:59,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-10-11 17:13:59,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:59,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1423] 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][351], [Black: 831#true, Black: 701#(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|)), 662#true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(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: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 304#L51-9true, Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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: 776#(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)), 865#true, Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 862#true, 48#L102-4true, 578#L65-1true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~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)), 718#true, 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 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)), 859#true, 171#L79-1true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:59,875 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-10-11 17:13:59,875 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-11 17:13:59,875 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-10-11 17:13:59,875 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-11 17:13:59,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][353], [Black: 831#true, Black: 701#(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|)), 662#true, 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(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: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(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: 776#(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)), 865#true, Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 862#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~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: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 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)), 859#true, 171#L79-1true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:13:59,912 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-10-11 17:13:59,912 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-10-11 17:13:59,912 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-10-11 17:13:59,912 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-10-11 17:13:59,918 INFO L124 PetriNetUnfolderBase]: 139/2925 cut-off events. [2024-10-11 17:13:59,918 INFO L125 PetriNetUnfolderBase]: For 336/359 co-relation queries the response was YES. [2024-10-11 17:13:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 2925 events. 139/2925 cut-off events. For 336/359 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 18678 event pairs, 27 based on Foata normal form. 0/2837 useless extension candidates. Maximal degree in co-relation 3851. Up to 90 conditions per place. [2024-10-11 17:13:59,965 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 10 selfloop transitions, 2 changer transitions 12/543 dead transitions. [2024-10-11 17:13:59,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 543 transitions, 1458 flow [2024-10-11 17:13:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-10-11 17:13:59,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-10-11 17:13:59,967 INFO L175 Difference]: Start difference. First operand has 586 places, 542 transitions, 1430 flow. Second operand 3 states and 1780 transitions. [2024-10-11 17:13:59,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 543 transitions, 1458 flow [2024-10-11 17:13:59,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 543 transitions, 1412 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-10-11 17:13:59,974 INFO L231 Difference]: Finished difference. Result has 567 places, 529 transitions, 1310 flow [2024-10-11 17:13:59,975 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=567, PETRI_TRANSITIONS=529} [2024-10-11 17:13:59,975 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -10 predicate places. [2024-10-11 17:13:59,975 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 529 transitions, 1310 flow [2024-10-11 17:13:59,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:59,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:59,976 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:59,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:13:59,976 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-10-11 17:13:59,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -256951214, now seen corresponding path program 1 times [2024-10-11 17:13:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109890271] [2024-10-11 17:13:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:14:00,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:00,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109890271] [2024-10-11 17:14:00,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109890271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:00,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:00,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:00,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879132993] [2024-10-11 17:14:00,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:00,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:00,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:00,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:00,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:00,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-10-11 17:14:00,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 529 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:00,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:00,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-10-11 17:14:00,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:00,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1423] 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][325], [Black: 831#true, 662#true, Black: 701#(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: 699#(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: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 304#L51-9true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 776#(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)), 865#true, Black: 658#true, 48#L102-4true, 578#L65-1true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~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)), 631#(= |#race~n3~0| 0), 718#true, Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 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)), 859#true, 171#L79-1true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 868#true, Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-10-11 17:14:00,275 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-10-11 17:14:00,275 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-11 17:14:00,275 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-10-11 17:14:00,275 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-11 17:14:00,294 INFO L124 PetriNetUnfolderBase]: 121/1832 cut-off events. [2024-10-11 17:14:00,295 INFO L125 PetriNetUnfolderBase]: For 185/202 co-relation queries the response was YES. [2024-10-11 17:14:00,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 1832 events. 121/1832 cut-off events. For 185/202 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10710 event pairs, 24 based on Foata normal form. 0/1766 useless extension candidates. Maximal degree in co-relation 2387. Up to 83 conditions per place. [2024-10-11 17:14:00,322 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 0 selfloop transitions, 0 changer transitions 530/530 dead transitions. [2024-10-11 17:14:00,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 530 transitions, 1338 flow [2024-10-11 17:14:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-10-11 17:14:00,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-10-11 17:14:00,324 INFO L175 Difference]: Start difference. First operand has 567 places, 529 transitions, 1310 flow. Second operand 3 states and 1780 transitions. [2024-10-11 17:14:00,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 530 transitions, 1338 flow [2024-10-11 17:14:00,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 530 transitions, 1278 flow, removed 8 selfloop flow, removed 17 redundant places. [2024-10-11 17:14:00,329 INFO L231 Difference]: Finished difference. Result has 544 places, 0 transitions, 0 flow [2024-10-11 17:14:00,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=544, PETRI_TRANSITIONS=0} [2024-10-11 17:14:00,329 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-10-11 17:14:00,329 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 0 transitions, 0 flow [2024-10-11 17:14:00,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:00,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (101 of 102 remaining) [2024-10-11 17:14:00,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (100 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (99 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (98 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (97 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (96 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (95 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (94 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (93 of 102 remaining) [2024-10-11 17:14:00,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (92 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (91 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (90 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (89 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (88 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (87 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (86 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (85 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (84 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (83 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (82 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (81 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (80 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (79 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (78 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (77 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (76 of 102 remaining) [2024-10-11 17:14:00,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (75 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (74 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (73 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (72 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (71 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (70 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (69 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (68 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (67 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (66 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (65 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (64 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (63 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (62 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (61 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (60 of 102 remaining) [2024-10-11 17:14:00,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (59 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (58 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (57 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (56 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (54 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (53 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (52 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (51 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (49 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (48 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (47 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (46 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2024-10-11 17:14:00,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2024-10-11 17:14:00,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2024-10-11 17:14:00,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 102 remaining) [2024-10-11 17:14:00,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 102 remaining) [2024-10-11 17:14:00,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 102 remaining) [2024-10-11 17:14:00,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 102 remaining) [2024-10-11 17:14:00,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 102 remaining) [2024-10-11 17:14:00,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 102 remaining) [2024-10-11 17:14:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 102 remaining) [2024-10-11 17:14:00,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 17:14:00,342 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:00,349 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:14:00,349 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:14:00,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:14:00 BasicIcfg [2024-10-11 17:14:00,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:14:00,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:14:00,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:14:00,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:14:00,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:24" (3/4) ... [2024-10-11 17:14:00,357 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:14:00,359 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:14:00,359 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:14:00,359 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:14:00,367 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-10-11 17:14:00,368 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:14:00,368 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:14:00,368 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:14:00,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:14:00,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:14:00,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:14:00,454 INFO L158 Benchmark]: Toolchain (without parser) took 37030.24ms. Allocated memory was 153.1MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 82.7MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-10-11 17:14:00,455 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:00,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.83ms. Allocated memory is still 153.1MB. Free memory was 82.4MB in the beginning and 119.7MB in the end (delta: -37.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:00,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.26ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 115.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:00,455 INFO L158 Benchmark]: Boogie Preprocessor took 57.24ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 111.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:00,456 INFO L158 Benchmark]: RCFGBuilder took 855.52ms. Allocated memory is still 153.1MB. Free memory was 111.3MB in the beginning and 65.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:00,456 INFO L158 Benchmark]: TraceAbstraction took 35704.50ms. Allocated memory was 153.1MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 64.3MB in the beginning and 4.8GB in the end (delta: -4.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-10-11 17:14:00,456 INFO L158 Benchmark]: Witness Printer took 99.71ms. Allocated memory is still 6.3GB. Free memory was 4.8GB in the beginning and 4.8GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 17:14:00,459 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.13ms. Allocated memory is still 153.1MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.83ms. Allocated memory is still 153.1MB. Free memory was 82.4MB in the beginning and 119.7MB in the end (delta: -37.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.26ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 115.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.24ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 111.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 855.52ms. Allocated memory is still 153.1MB. Free memory was 111.3MB in the beginning and 65.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35704.50ms. Allocated memory was 153.1MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 64.3MB in the beginning and 4.8GB in the end (delta: -4.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 99.71ms. Allocated memory is still 6.3GB. Free memory was 4.8GB in the beginning and 4.8GB 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: 119]: 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: 119]: 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: 119]: 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: 107]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 923 locations, 102 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.4s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6759 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4292 mSDsluCounter, 7036 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6465 mSDsCounter, 1290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10422 IncrementalHoareTripleChecker+Invalid, 11712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1290 mSolverCounterUnsat, 571 mSDtfsCounter, 10422 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1684occurred in iteration=24, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6252 ConstructedInterpolants, 0 QuantifiedInterpolants, 8576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:14:00,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE