./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/popl20-more-mts.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/popl20-more-mts.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:17:01,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:17:01,887 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:17:01,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:17:01,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:17:01,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:17:01,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:17:01,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:17:01,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:17:01,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:17:01,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:17:01,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:17:01,939 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:17:01,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:17:01,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:17:01,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:17:01,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:17:01,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:17:01,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:17:01,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:17:01,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:17:01,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:17:01,943 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:17:01,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:17:01,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:17:01,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:17:01,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:17:01,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:17:01,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:17:01,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:17:01,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:17:01,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:01,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:17:01,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:17:01,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:17:01,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:17:01,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:17:01,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:17:01,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:17:01,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:17:01,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:17:01,949 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-10-11 17:17:02,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:17:02,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:17:02,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:17:02,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:17:02,168 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:17:02,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-10-11 17:17:03,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:17:03,667 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:17:03,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-10-11 17:17:03,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8c1cf833f/73bffc47db7449a7a3f2b32123facf49/FLAGbf663da4b [2024-10-11 17:17:04,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8c1cf833f/73bffc47db7449a7a3f2b32123facf49 [2024-10-11 17:17:04,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:17:04,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:17:04,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:04,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:17:04,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:17:04,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5909e0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04, skipping insertion in model container [2024-10-11 17:17:04,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:17:04,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:04,277 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:17:04,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:04,315 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:17:04,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04 WrapperNode [2024-10-11 17:17:04,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:04,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:04,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:17:04,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:17:04,322 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:17:04" (1/1) ... [2024-10-11 17:17:04,333 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:17:04" (1/1) ... [2024-10-11 17:17:04,385 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 354 [2024-10-11 17:17:04,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:04,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:17:04,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:17:04,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:17:04,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:17:04,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:17:04,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:17:04,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:17:04,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:04,500 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:17:04,506 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:17:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:17:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:17:04,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:17:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:17:04,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:17:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:17:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:17:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:17:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:17:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:17:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:17:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:17:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:17:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:17:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:17:04,587 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:17:04,734 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:17:04,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:17:05,270 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:17:05,271 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:17:05,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:17:05,642 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:17:05,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:05 BoogieIcfgContainer [2024-10-11 17:17:05,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:17:05,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:17:05,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:17:05,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:17:05,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:17:04" (1/3) ... [2024-10-11 17:17:05,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698e1680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:05, skipping insertion in model container [2024-10-11 17:17:05,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04" (2/3) ... [2024-10-11 17:17:05,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698e1680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:05, skipping insertion in model container [2024-10-11 17:17:05,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:05" (3/3) ... [2024-10-11 17:17:05,653 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-10-11 17:17:05,667 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:17:05,667 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 17:17:05,668 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:17:05,771 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:17:05,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 360 places, 370 transitions, 761 flow [2024-10-11 17:17:05,932 INFO L124 PetriNetUnfolderBase]: 20/367 cut-off events. [2024-10-11 17:17:05,934 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:05,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 367 events. 20/367 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 876 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2024-10-11 17:17:05,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 360 places, 370 transitions, 761 flow [2024-10-11 17:17:05,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 346 transitions, 710 flow [2024-10-11 17:17:05,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:17:05,978 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;@116f52d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:17:05,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-10-11 17:17:05,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:17:05,986 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-11 17:17:05,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:17:05,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:05,987 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] [2024-10-11 17:17:05,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:05,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash -163906003, now seen corresponding path program 1 times [2024-10-11 17:17:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:06,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581560302] [2024-10-11 17:17:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:06,252 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:17:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581560302] [2024-10-11 17:17:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581560302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362834110] [2024-10-11 17:17:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:06,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:06,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:06,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 370 [2024-10-11 17:17:06,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 346 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 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:17:06,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:06,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 370 [2024-10-11 17:17:06,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:06,611 INFO L124 PetriNetUnfolderBase]: 32/689 cut-off events. [2024-10-11 17:17:06,611 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 17:17:06,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 689 events. 32/689 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3093 event pairs, 12 based on Foata normal form. 30/611 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-10-11 17:17:06,625 INFO L140 encePairwiseOnDemand]: 345/370 looper letters, 14 selfloop transitions, 2 changer transitions 3/323 dead transitions. [2024-10-11 17:17:06,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 323 transitions, 696 flow [2024-10-11 17:17:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2024-10-11 17:17:06,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216216216216216 [2024-10-11 17:17:06,644 INFO L175 Difference]: Start difference. First operand has 338 places, 346 transitions, 710 flow. Second operand 3 states and 1023 transitions. [2024-10-11 17:17:06,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 323 transitions, 696 flow [2024-10-11 17:17:06,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 323 transitions, 684 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:17:06,655 INFO L231 Difference]: Finished difference. Result has 322 places, 320 transitions, 650 flow [2024-10-11 17:17:06,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=322, PETRI_TRANSITIONS=320} [2024-10-11 17:17:06,661 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -16 predicate places. [2024-10-11 17:17:06,662 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 320 transitions, 650 flow [2024-10-11 17:17:06,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 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:17:06,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:06,663 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] [2024-10-11 17:17:06,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:17:06,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 6455061, now seen corresponding path program 1 times [2024-10-11 17:17:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750050343] [2024-10-11 17:17:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:06,721 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:17:06,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:06,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750050343] [2024-10-11 17:17:06,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750050343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:06,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:06,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28364974] [2024-10-11 17:17:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:06,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:06,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:06,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:06,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:06,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 370 [2024-10-11 17:17:06,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 320 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 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:17:06,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:06,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 370 [2024-10-11 17:17:06,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:06,848 INFO L124 PetriNetUnfolderBase]: 23/635 cut-off events. [2024-10-11 17:17:06,848 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:06,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 635 events. 23/635 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2755 event pairs, 8 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 649. Up to 35 conditions per place. [2024-10-11 17:17:06,855 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 14 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2024-10-11 17:17:06,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 319 transitions, 680 flow [2024-10-11 17:17:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-10-11 17:17:06,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018018018018018 [2024-10-11 17:17:06,860 INFO L175 Difference]: Start difference. First operand has 322 places, 320 transitions, 650 flow. Second operand 3 states and 1001 transitions. [2024-10-11 17:17:06,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 319 transitions, 680 flow [2024-10-11 17:17:06,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:06,867 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 648 flow [2024-10-11 17:17:06,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2024-10-11 17:17:06,868 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2024-10-11 17:17:06,868 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 648 flow [2024-10-11 17:17:06,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 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:17:06,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:06,869 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:06,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:17:06,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash -478338, now seen corresponding path program 1 times [2024-10-11 17:17:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219695918] [2024-10-11 17:17:06,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:06,923 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:17:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219695918] [2024-10-11 17:17:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219695918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:06,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811226160] [2024-10-11 17:17:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:06,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:06,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-10-11 17:17:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 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:17:06,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:06,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-10-11 17:17:06,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:07,036 INFO L124 PetriNetUnfolderBase]: 35/596 cut-off events. [2024-10-11 17:17:07,037 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:17:07,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 596 events. 35/596 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2514 event pairs, 16 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 625. Up to 56 conditions per place. [2024-10-11 17:17:07,044 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 1 changer transitions 0/315 dead transitions. [2024-10-11 17:17:07,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 672 flow [2024-10-11 17:17:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2024-10-11 17:17:07,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8990990990990991 [2024-10-11 17:17:07,047 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 648 flow. Second operand 3 states and 998 transitions. [2024-10-11 17:17:07,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 672 flow [2024-10-11 17:17:07,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:07,051 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 638 flow [2024-10-11 17:17:07,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2024-10-11 17:17:07,052 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -24 predicate places. [2024-10-11 17:17:07,053 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 638 flow [2024-10-11 17:17:07,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 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:17:07,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:07,054 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] [2024-10-11 17:17:07,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:17:07,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:07,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1722877668, now seen corresponding path program 1 times [2024-10-11 17:17:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956201172] [2024-10-11 17:17:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:07,499 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:17:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956201172] [2024-10-11 17:17:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956201172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458285918] [2024-10-11 17:17:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:07,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 370 [2024-10-11 17:17:07,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:17:07,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:07,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 370 [2024-10-11 17:17:07,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,060 INFO L124 PetriNetUnfolderBase]: 541/3451 cut-off events. [2024-10-11 17:17:08,061 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-11 17:17:08,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 3451 events. 541/3451 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 28454 event pairs, 386 based on Foata normal form. 0/2889 useless extension candidates. Maximal degree in co-relation 4297. Up to 786 conditions per place. [2024-10-11 17:17:08,086 INFO L140 encePairwiseOnDemand]: 364/370 looper letters, 31 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2024-10-11 17:17:08,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 314 transitions, 708 flow [2024-10-11 17:17:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1891 transitions. [2024-10-11 17:17:08,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8518018018018018 [2024-10-11 17:17:08,089 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 638 flow. Second operand 6 states and 1891 transitions. [2024-10-11 17:17:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 314 transitions, 708 flow [2024-10-11 17:17:08,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 314 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:08,093 INFO L231 Difference]: Finished difference. Result has 317 places, 314 transitions, 645 flow [2024-10-11 17:17:08,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=645, PETRI_PLACES=317, PETRI_TRANSITIONS=314} [2024-10-11 17:17:08,095 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -21 predicate places. [2024-10-11 17:17:08,095 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 314 transitions, 645 flow [2024-10-11 17:17:08,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:17:08,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,096 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] [2024-10-11 17:17:08,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:17:08,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1916769558, now seen corresponding path program 1 times [2024-10-11 17:17:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418367399] [2024-10-11 17:17:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,124 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:17:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418367399] [2024-10-11 17:17:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418367399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991474265] [2024-10-11 17:17:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:08,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 370 [2024-10-11 17:17:08,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 314 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 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:17:08,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:08,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 370 [2024-10-11 17:17:08,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,285 INFO L124 PetriNetUnfolderBase]: 57/675 cut-off events. [2024-10-11 17:17:08,285 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:17:08,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 675 events. 57/675 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3235 event pairs, 38 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 761. Up to 81 conditions per place. [2024-10-11 17:17:08,291 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 14 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2024-10-11 17:17:08,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 675 flow [2024-10-11 17:17:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-10-11 17:17:08,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018018018018018 [2024-10-11 17:17:08,294 INFO L175 Difference]: Start difference. First operand has 317 places, 314 transitions, 645 flow. Second operand 3 states and 1001 transitions. [2024-10-11 17:17:08,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 675 flow [2024-10-11 17:17:08,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 313 transitions, 665 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:08,299 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 637 flow [2024-10-11 17:17:08,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2024-10-11 17:17:08,300 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -25 predicate places. [2024-10-11 17:17:08,300 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 637 flow [2024-10-11 17:17:08,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 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:17:08,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,301 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] [2024-10-11 17:17:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:17:08,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1904622188, now seen corresponding path program 1 times [2024-10-11 17:17:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954490852] [2024-10-11 17:17:08,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,326 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:17:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954490852] [2024-10-11 17:17:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954490852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011118721] [2024-10-11 17:17:08,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:08,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-10-11 17:17:08,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 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:17:08,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:08,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-10-11 17:17:08,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,418 INFO L124 PetriNetUnfolderBase]: 52/649 cut-off events. [2024-10-11 17:17:08,419 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-11 17:17:08,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 649 events. 52/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2864 event pairs, 28 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 694. Up to 73 conditions per place. [2024-10-11 17:17:08,425 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2024-10-11 17:17:08,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 309 transitions, 661 flow [2024-10-11 17:17:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2024-10-11 17:17:08,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8990990990990991 [2024-10-11 17:17:08,428 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 637 flow. Second operand 3 states and 998 transitions. [2024-10-11 17:17:08,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 309 transitions, 661 flow [2024-10-11 17:17:08,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 309 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:08,431 INFO L231 Difference]: Finished difference. Result has 309 places, 309 transitions, 627 flow [2024-10-11 17:17:08,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=309, PETRI_TRANSITIONS=309} [2024-10-11 17:17:08,432 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2024-10-11 17:17:08,432 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 309 transitions, 627 flow [2024-10-11 17:17:08,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 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:17:08,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,433 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] [2024-10-11 17:17:08,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:17:08,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:08,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash 323218000, now seen corresponding path program 1 times [2024-10-11 17:17:08,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278412624] [2024-10-11 17:17:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,459 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:17:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278412624] [2024-10-11 17:17:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278412624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767226866] [2024-10-11 17:17:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:08,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:08,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 370 [2024-10-11 17:17:08,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 309 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 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:17:08,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:08,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 370 [2024-10-11 17:17:08,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,538 INFO L124 PetriNetUnfolderBase]: 30/587 cut-off events. [2024-10-11 17:17:08,539 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:17:08,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 587 events. 30/587 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2273 event pairs, 5 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 614. Up to 30 conditions per place. [2024-10-11 17:17:08,544 INFO L140 encePairwiseOnDemand]: 364/370 looper letters, 14 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2024-10-11 17:17:08,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 663 flow [2024-10-11 17:17:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2024-10-11 17:17:08,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072072072072072 [2024-10-11 17:17:08,546 INFO L175 Difference]: Start difference. First operand has 309 places, 309 transitions, 627 flow. Second operand 3 states and 1007 transitions. [2024-10-11 17:17:08,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 663 flow [2024-10-11 17:17:08,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:08,550 INFO L231 Difference]: Finished difference. Result has 307 places, 306 transitions, 626 flow [2024-10-11 17:17:08,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=307, PETRI_TRANSITIONS=306} [2024-10-11 17:17:08,551 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -31 predicate places. [2024-10-11 17:17:08,551 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 306 transitions, 626 flow [2024-10-11 17:17:08,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 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:17:08,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,553 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] [2024-10-11 17:17:08,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:17:08,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:08,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1374889682, now seen corresponding path program 1 times [2024-10-11 17:17:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112026511] [2024-10-11 17:17:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,586 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:17:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112026511] [2024-10-11 17:17:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112026511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739354291] [2024-10-11 17:17:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:08,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-10-11 17:17:08,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 306 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 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:17:08,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:08,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-10-11 17:17:08,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,807 INFO L124 PetriNetUnfolderBase]: 236/2175 cut-off events. [2024-10-11 17:17:08,808 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-11 17:17:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 2175 events. 236/2175 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15599 event pairs, 61 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 2513. Up to 305 conditions per place. [2024-10-11 17:17:08,828 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2024-10-11 17:17:08,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 310 transitions, 687 flow [2024-10-11 17:17:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2024-10-11 17:17:08,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9063063063063063 [2024-10-11 17:17:08,830 INFO L175 Difference]: Start difference. First operand has 307 places, 306 transitions, 626 flow. Second operand 3 states and 1006 transitions. [2024-10-11 17:17:08,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 310 transitions, 687 flow [2024-10-11 17:17:08,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 310 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:08,836 INFO L231 Difference]: Finished difference. Result has 304 places, 305 transitions, 633 flow [2024-10-11 17:17:08,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=304, PETRI_TRANSITIONS=305} [2024-10-11 17:17:08,837 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -34 predicate places. [2024-10-11 17:17:08,837 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 305 transitions, 633 flow [2024-10-11 17:17:08,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 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:17:08,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,838 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] [2024-10-11 17:17:08,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:17:08,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash -88337490, now seen corresponding path program 1 times [2024-10-11 17:17:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753331507] [2024-10-11 17:17:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,861 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:17:08,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753331507] [2024-10-11 17:17:08,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753331507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100934090] [2024-10-11 17:17:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:08,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:08,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-10-11 17:17:08,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 305 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 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:17:08,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:08,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-10-11 17:17:08,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,992 INFO L124 PetriNetUnfolderBase]: 120/903 cut-off events. [2024-10-11 17:17:08,992 INFO L125 PetriNetUnfolderBase]: For 80/88 co-relation queries the response was YES. [2024-10-11 17:17:08,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 903 events. 120/903 cut-off events. For 80/88 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4925 event pairs, 7 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1130. Up to 116 conditions per place. [2024-10-11 17:17:09,000 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 18 selfloop transitions, 3 changer transitions 0/305 dead transitions. [2024-10-11 17:17:09,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 305 transitions, 682 flow [2024-10-11 17:17:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-10-11 17:17:09,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018018018018018 [2024-10-11 17:17:09,002 INFO L175 Difference]: Start difference. First operand has 304 places, 305 transitions, 633 flow. Second operand 3 states and 1001 transitions. [2024-10-11 17:17:09,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 305 transitions, 682 flow [2024-10-11 17:17:09,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 305 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:09,006 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 631 flow [2024-10-11 17:17:09,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-10-11 17:17:09,007 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -36 predicate places. [2024-10-11 17:17:09,007 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 631 flow [2024-10-11 17:17:09,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 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:17:09,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:09,008 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] [2024-10-11 17:17:09,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:17:09,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1561843702, now seen corresponding path program 1 times [2024-10-11 17:17:09,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:09,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889924409] [2024-10-11 17:17:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:09,120 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:17:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889924409] [2024-10-11 17:17:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889924409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:17:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777932008] [2024-10-11 17:17:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:09,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:17:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:17:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:17:09,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 370 [2024-10-11 17:17:09,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 631 flow. Second operand has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 0 states have call successors, (0), 0 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:17:09,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:09,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 370 [2024-10-11 17:17:09,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:09,522 INFO L124 PetriNetUnfolderBase]: 115/1253 cut-off events. [2024-10-11 17:17:09,522 INFO L125 PetriNetUnfolderBase]: For 68/108 co-relation queries the response was YES. [2024-10-11 17:17:09,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 1253 events. 115/1253 cut-off events. For 68/108 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7421 event pairs, 30 based on Foata normal form. 6/1141 useless extension candidates. Maximal degree in co-relation 1527. Up to 106 conditions per place. [2024-10-11 17:17:09,531 INFO L140 encePairwiseOnDemand]: 357/370 looper letters, 28 selfloop transitions, 14 changer transitions 0/320 dead transitions. [2024-10-11 17:17:09,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 320 transitions, 771 flow [2024-10-11 17:17:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:17:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:17:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3280 transitions. [2024-10-11 17:17:09,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8864864864864865 [2024-10-11 17:17:09,536 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 631 flow. Second operand 10 states and 3280 transitions. [2024-10-11 17:17:09,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 320 transitions, 771 flow [2024-10-11 17:17:09,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 320 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:09,541 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 691 flow [2024-10-11 17:17:09,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=691, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2024-10-11 17:17:09,543 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -25 predicate places. [2024-10-11 17:17:09,544 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 691 flow [2024-10-11 17:17:09,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 0 states have call successors, (0), 0 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:17:09,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:09,545 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] [2024-10-11 17:17:09,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:17:09,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:09,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1054403412, now seen corresponding path program 1 times [2024-10-11 17:17:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:09,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464808962] [2024-10-11 17:17:09,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:09,628 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:17:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464808962] [2024-10-11 17:17:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464808962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146726586] [2024-10-11 17:17:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:09,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:17:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:17:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:17:09,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-10-11 17:17:09,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 691 flow. Second operand has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 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:17:09,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:09,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-10-11 17:17:09,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:09,949 INFO L124 PetriNetUnfolderBase]: 222/1940 cut-off events. [2024-10-11 17:17:09,949 INFO L125 PetriNetUnfolderBase]: For 191/200 co-relation queries the response was YES. [2024-10-11 17:17:09,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1940 events. 222/1940 cut-off events. For 191/200 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13203 event pairs, 75 based on Foata normal form. 12/1773 useless extension candidates. Maximal degree in co-relation 2499. Up to 218 conditions per place. [2024-10-11 17:17:09,963 INFO L140 encePairwiseOnDemand]: 364/370 looper letters, 30 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2024-10-11 17:17:09,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 323 transitions, 809 flow [2024-10-11 17:17:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:17:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:17:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1663 transitions. [2024-10-11 17:17:09,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898918918918919 [2024-10-11 17:17:09,967 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 691 flow. Second operand 5 states and 1663 transitions. [2024-10-11 17:17:09,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 323 transitions, 809 flow [2024-10-11 17:17:09,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 323 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:09,972 INFO L231 Difference]: Finished difference. Result has 318 places, 310 transitions, 712 flow [2024-10-11 17:17:09,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=318, PETRI_TRANSITIONS=310} [2024-10-11 17:17:09,973 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2024-10-11 17:17:09,973 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 310 transitions, 712 flow [2024-10-11 17:17:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 0 states have call successors, (0), 0 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:17:09,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:09,974 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] [2024-10-11 17:17:09,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:17:09,974 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash 88694419, now seen corresponding path program 1 times [2024-10-11 17:17:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643895809] [2024-10-11 17:17:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:10,294 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:17:10,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:10,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643895809] [2024-10-11 17:17:10,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643895809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:10,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:10,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145221702] [2024-10-11 17:17:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:10,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:10,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:10,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 370 [2024-10-11 17:17:10,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 310 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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:17:10,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:10,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 370 [2024-10-11 17:17:10,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:10,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1297] L64-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse9 (+ .cse13 v_~A~0.offset_222))) (let ((.cse10 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse9))) (let ((.cse3 (+ v_~mts3~0_159 .cse10))) (let ((.cse12 (<= .cse3 2147483647)) (.cse6 (select |v_#race_453| v_~A~0.base_222)) (.cse8 (+ .cse13 v_~A~0.offset_222 1)) (.cse7 (+ .cse13 v_~A~0.offset_222 2)) (.cse1 (+ .cse13 v_~A~0.offset_222 3)) (.cse11 (<= 0 (+ v_~mts3~0_159 2147483648 .cse10))) (.cse0 (select |v_#race_441| v_~A~0.base_222))) (and (= (select .cse0 .cse1) 0) (let ((.cse2 (= |v_#race~A~0_277| 0)) (.cse4 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse9 0) .cse8 0) .cse7 0) .cse1 0)))) (.cse5 (= |v_#race~mts3~0_254| 0))) (or (and .cse2 (= v_~mts3~0_158 0) (< .cse3 0) .cse4 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_180|) .cse5) (and (= (select .cse6 .cse7) 0) (<= 0 .cse3) .cse2 (= (select .cse6 .cse8) 0) .cse4 (= (select .cse6 .cse1) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse5 (= (select .cse6 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse10)))) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse8) 0) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648)) (<= v_~sum~0_94 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) .cse11 (<= v_~sum~0_93 2147483647) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= .cse10 0) .cse12) 1 0) 0)) (= (select .cse0 .cse7) 0) .cse12 (= (+ v_~sum~0_94 .cse10) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse6 .cse9 0) .cse8 0) .cse7 0) .cse1 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_94)) 1 0) 0)) (not (= (ite (or .cse11 (<= 0 .cse10)) 1 0) 0)) (= (select .cse0 .cse9) 0) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_123|, #race=|v_#race_441|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][178], [Black: 418#(<= (+ ~M~0 1) 0), 83#L59true, Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 387#true, 383#(= |#race~M~0| 0), 422#true, 208#L48-3true, 194#L67true, 389#(= |#race~A~0| 0), 206#L86-4true, Black: 406#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 371#(= |#race~N~0| 0), 415#true, Black: 400#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 404#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 399#(<= ~N~0 0)]) [2024-10-11 17:17:10,791 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-11 17:17:10,791 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:17:10,791 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-11 17:17:10,791 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:17:10,836 INFO L124 PetriNetUnfolderBase]: 406/2433 cut-off events. [2024-10-11 17:17:10,836 INFO L125 PetriNetUnfolderBase]: For 450/464 co-relation queries the response was YES. [2024-10-11 17:17:10,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 2433 events. 406/2433 cut-off events. For 450/464 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 18120 event pairs, 71 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 3468. Up to 281 conditions per place. [2024-10-11 17:17:10,860 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 36 selfloop transitions, 5 changer transitions 0/320 dead transitions. [2024-10-11 17:17:10,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 830 flow [2024-10-11 17:17:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2024-10-11 17:17:10,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774774774774775 [2024-10-11 17:17:10,864 INFO L175 Difference]: Start difference. First operand has 318 places, 310 transitions, 712 flow. Second operand 6 states and 1948 transitions. [2024-10-11 17:17:10,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 830 flow [2024-10-11 17:17:10,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:10,868 INFO L231 Difference]: Finished difference. Result has 319 places, 308 transitions, 713 flow [2024-10-11 17:17:10,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=319, PETRI_TRANSITIONS=308} [2024-10-11 17:17:10,869 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -19 predicate places. [2024-10-11 17:17:10,869 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 308 transitions, 713 flow [2024-10-11 17:17:10,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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:17:10,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:10,871 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] [2024-10-11 17:17:10,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:17:10,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1262275170, now seen corresponding path program 1 times [2024-10-11 17:17:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:10,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143665607] [2024-10-11 17:17:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:11,140 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:17:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143665607] [2024-10-11 17:17:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143665607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:11,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:11,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315595724] [2024-10-11 17:17:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:11,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:11,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 370 [2024-10-11 17:17:11,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 308 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 0 states have call successors, (0), 0 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:17:11,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:11,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 370 [2024-10-11 17:17:11,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,611 INFO L124 PetriNetUnfolderBase]: 251/1801 cut-off events. [2024-10-11 17:17:11,611 INFO L125 PetriNetUnfolderBase]: For 239/319 co-relation queries the response was YES. [2024-10-11 17:17:11,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1801 events. 251/1801 cut-off events. For 239/319 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12920 event pairs, 50 based on Foata normal form. 4/1680 useless extension candidates. Maximal degree in co-relation 2617. Up to 221 conditions per place. [2024-10-11 17:17:11,627 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 36 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2024-10-11 17:17:11,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 318 transitions, 831 flow [2024-10-11 17:17:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2024-10-11 17:17:11,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774774774774775 [2024-10-11 17:17:11,631 INFO L175 Difference]: Start difference. First operand has 319 places, 308 transitions, 713 flow. Second operand 6 states and 1948 transitions. [2024-10-11 17:17:11,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 318 transitions, 831 flow [2024-10-11 17:17:11,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 821 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:11,636 INFO L231 Difference]: Finished difference. Result has 317 places, 306 transitions, 709 flow [2024-10-11 17:17:11,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=317, PETRI_TRANSITIONS=306} [2024-10-11 17:17:11,637 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -21 predicate places. [2024-10-11 17:17:11,637 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 306 transitions, 709 flow [2024-10-11 17:17:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 0 states have call successors, (0), 0 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:17:11,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:11,638 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] [2024-10-11 17:17:11,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:17:11,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:11,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 17984448, now seen corresponding path program 1 times [2024-10-11 17:17:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870229288] [2024-10-11 17:17:11,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:11,668 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:17:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870229288] [2024-10-11 17:17:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870229288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:11,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278635379] [2024-10-11 17:17:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:11,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:11,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 370 [2024-10-11 17:17:11,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 306 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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:17:11,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:11,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 370 [2024-10-11 17:17:11,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,806 INFO L124 PetriNetUnfolderBase]: 73/1183 cut-off events. [2024-10-11 17:17:11,806 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2024-10-11 17:17:11,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1183 events. 73/1183 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6780 event pairs, 11 based on Foata normal form. 8/1126 useless extension candidates. Maximal degree in co-relation 1459. Up to 99 conditions per place. [2024-10-11 17:17:11,814 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 9 selfloop transitions, 1 changer transitions 2/304 dead transitions. [2024-10-11 17:17:11,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 304 transitions, 727 flow [2024-10-11 17:17:11,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-10-11 17:17:11,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108108108108108 [2024-10-11 17:17:11,817 INFO L175 Difference]: Start difference. First operand has 317 places, 306 transitions, 709 flow. Second operand 3 states and 1011 transitions. [2024-10-11 17:17:11,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 304 transitions, 727 flow [2024-10-11 17:17:11,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:11,821 INFO L231 Difference]: Finished difference. Result has 312 places, 302 transitions, 693 flow [2024-10-11 17:17:11,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=312, PETRI_TRANSITIONS=302} [2024-10-11 17:17:11,822 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -26 predicate places. [2024-10-11 17:17:11,822 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 302 transitions, 693 flow [2024-10-11 17:17:11,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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:17:11,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:11,822 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] [2024-10-11 17:17:11,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:17:11,823 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1772614929, now seen corresponding path program 1 times [2024-10-11 17:17:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:11,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056423445] [2024-10-11 17:17:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:11,850 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:17:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:11,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056423445] [2024-10-11 17:17:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056423445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:11,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:11,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:11,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966726176] [2024-10-11 17:17:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:11,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:11,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 370 [2024-10-11 17:17:11,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 302 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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:17:11,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:11,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 370 [2024-10-11 17:17:11,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,998 INFO L124 PetriNetUnfolderBase]: 73/1151 cut-off events. [2024-10-11 17:17:11,998 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2024-10-11 17:17:12,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1151 events. 73/1151 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6456 event pairs, 11 based on Foata normal form. 8/1110 useless extension candidates. Maximal degree in co-relation 1405. Up to 99 conditions per place. [2024-10-11 17:17:12,009 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 6 selfloop transitions, 0 changer transitions 14/300 dead transitions. [2024-10-11 17:17:12,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 300 transitions, 711 flow [2024-10-11 17:17:12,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-10-11 17:17:12,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108108108108108 [2024-10-11 17:17:12,011 INFO L175 Difference]: Start difference. First operand has 312 places, 302 transitions, 693 flow. Second operand 3 states and 1011 transitions. [2024-10-11 17:17:12,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 300 transitions, 711 flow [2024-10-11 17:17:12,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 300 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:12,015 INFO L231 Difference]: Finished difference. Result has 309 places, 286 transitions, 657 flow [2024-10-11 17:17:12,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=309, PETRI_TRANSITIONS=286} [2024-10-11 17:17:12,016 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2024-10-11 17:17:12,016 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 286 transitions, 657 flow [2024-10-11 17:17:12,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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:17:12,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:12,017 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] [2024-10-11 17:17:12,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:17:12,017 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:12,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 215320777, now seen corresponding path program 1 times [2024-10-11 17:17:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:12,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868826369] [2024-10-11 17:17:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:12,077 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:17:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868826369] [2024-10-11 17:17:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868826369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126073988] [2024-10-11 17:17:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:12,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:12,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 370 [2024-10-11 17:17:12,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:17:12,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:12,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 370 [2024-10-11 17:17:12,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:12,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1297] L64-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse9 (+ .cse13 v_~A~0.offset_222))) (let ((.cse10 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse9))) (let ((.cse3 (+ v_~mts3~0_159 .cse10))) (let ((.cse12 (<= .cse3 2147483647)) (.cse6 (select |v_#race_453| v_~A~0.base_222)) (.cse8 (+ .cse13 v_~A~0.offset_222 1)) (.cse7 (+ .cse13 v_~A~0.offset_222 2)) (.cse1 (+ .cse13 v_~A~0.offset_222 3)) (.cse11 (<= 0 (+ v_~mts3~0_159 2147483648 .cse10))) (.cse0 (select |v_#race_441| v_~A~0.base_222))) (and (= (select .cse0 .cse1) 0) (let ((.cse2 (= |v_#race~A~0_277| 0)) (.cse4 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse9 0) .cse8 0) .cse7 0) .cse1 0)))) (.cse5 (= |v_#race~mts3~0_254| 0))) (or (and .cse2 (= v_~mts3~0_158 0) (< .cse3 0) .cse4 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_180|) .cse5) (and (= (select .cse6 .cse7) 0) (<= 0 .cse3) .cse2 (= (select .cse6 .cse8) 0) .cse4 (= (select .cse6 .cse1) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse5 (= (select .cse6 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse10)))) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse8) 0) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648)) (<= v_~sum~0_94 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) .cse11 (<= v_~sum~0_93 2147483647) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= .cse10 0) .cse12) 1 0) 0)) (= (select .cse0 .cse7) 0) .cse12 (= (+ v_~sum~0_94 .cse10) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse6 .cse9 0) .cse8 0) .cse7 0) .cse1 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_94)) 1 0) 0)) (not (= (ite (or .cse11 (<= 0 .cse10)) 1 0) 0)) (= (select .cse0 .cse9) 0) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_123|, #race=|v_#race_441|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][175], [437#true, Black: 418#(<= (+ ~M~0 1) 0), Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 387#true, 383#(= |#race~M~0| 0), 440#true, 208#L48-3true, 194#L67true, 389#(= |#race~A~0| 0), 206#L86-4true, 371#(= |#race~N~0| 0), Black: 406#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 400#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 404#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 399#(<= ~N~0 0), 270#L56-1true]) [2024-10-11 17:17:12,519 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-11 17:17:12,519 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:17:12,520 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:17:12,520 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-11 17:17:12,650 INFO L124 PetriNetUnfolderBase]: 205/1866 cut-off events. [2024-10-11 17:17:12,650 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2024-10-11 17:17:12,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1866 events. 205/1866 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12093 event pairs, 54 based on Foata normal form. 0/1744 useless extension candidates. Maximal degree in co-relation 2405. Up to 200 conditions per place. [2024-10-11 17:17:12,679 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 12 selfloop transitions, 2 changer transitions 7/288 dead transitions. [2024-10-11 17:17:12,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 695 flow [2024-10-11 17:17:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2024-10-11 17:17:12,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2024-10-11 17:17:12,686 INFO L175 Difference]: Start difference. First operand has 309 places, 286 transitions, 657 flow. Second operand 3 states and 1005 transitions. [2024-10-11 17:17:12,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 695 flow [2024-10-11 17:17:12,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 695 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:12,695 INFO L231 Difference]: Finished difference. Result has 294 places, 279 transitions, 627 flow [2024-10-11 17:17:12,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=294, PETRI_TRANSITIONS=279} [2024-10-11 17:17:12,695 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -44 predicate places. [2024-10-11 17:17:12,696 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 279 transitions, 627 flow [2024-10-11 17:17:12,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:17:12,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:12,700 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] [2024-10-11 17:17:12,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:17:12,701 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-10-11 17:17:12,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash 55616852, now seen corresponding path program 1 times [2024-10-11 17:17:12,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:12,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026251800] [2024-10-11 17:17:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:12,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:12,780 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:17:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026251800] [2024-10-11 17:17:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026251800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:12,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:12,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108268752] [2024-10-11 17:17:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:12,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:12,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 370 [2024-10-11 17:17:12,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 279 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 0 states have call successors, (0), 0 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:17:12,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:12,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 370 [2024-10-11 17:17:12,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:13,075 INFO L124 PetriNetUnfolderBase]: 125/1615 cut-off events. [2024-10-11 17:17:13,075 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-10-11 17:17:13,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1615 events. 125/1615 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9783 event pairs, 37 based on Foata normal form. 0/1522 useless extension candidates. Maximal degree in co-relation 2004. Up to 131 conditions per place. [2024-10-11 17:17:13,087 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2024-10-11 17:17:13,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 281 transitions, 665 flow [2024-10-11 17:17:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2024-10-11 17:17:13,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081081081081082 [2024-10-11 17:17:13,090 INFO L175 Difference]: Start difference. First operand has 294 places, 279 transitions, 627 flow. Second operand 3 states and 1008 transitions. [2024-10-11 17:17:13,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 281 transitions, 665 flow [2024-10-11 17:17:13,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 641 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-10-11 17:17:13,094 INFO L231 Difference]: Finished difference. Result has 283 places, 0 transitions, 0 flow [2024-10-11 17:17:13,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=283, PETRI_TRANSITIONS=0} [2024-10-11 17:17:13,095 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -55 predicate places. [2024-10-11 17:17:13,095 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 0 transitions, 0 flow [2024-10-11 17:17:13,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 0 states have call successors, (0), 0 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:17:13,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 76 remaining) [2024-10-11 17:17:13,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 76 remaining) [2024-10-11 17:17:13,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 76 remaining) [2024-10-11 17:17:13,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 76 remaining) [2024-10-11 17:17:13,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 76 remaining) [2024-10-11 17:17:13,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 76 remaining) [2024-10-11 17:17:13,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (69 of 76 remaining) [2024-10-11 17:17:13,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 76 remaining) [2024-10-11 17:17:13,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 76 remaining) [2024-10-11 17:17:13,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (66 of 76 remaining) [2024-10-11 17:17:13,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (65 of 76 remaining) [2024-10-11 17:17:13,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 76 remaining) [2024-10-11 17:17:13,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 76 remaining) [2024-10-11 17:17:13,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 76 remaining) [2024-10-11 17:17:13,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 76 remaining) [2024-10-11 17:17:13,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 76 remaining) [2024-10-11 17:17:13,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 76 remaining) [2024-10-11 17:17:13,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 76 remaining) [2024-10-11 17:17:13,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 76 remaining) [2024-10-11 17:17:13,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 76 remaining) [2024-10-11 17:17:13,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 76 remaining) [2024-10-11 17:17:13,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 76 remaining) [2024-10-11 17:17:13,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 76 remaining) [2024-10-11 17:17:13,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 76 remaining) [2024-10-11 17:17:13,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 76 remaining) [2024-10-11 17:17:13,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 76 remaining) [2024-10-11 17:17:13,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 76 remaining) [2024-10-11 17:17:13,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 76 remaining) [2024-10-11 17:17:13,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (47 of 76 remaining) [2024-10-11 17:17:13,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 76 remaining) [2024-10-11 17:17:13,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 76 remaining) [2024-10-11 17:17:13,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 76 remaining) [2024-10-11 17:17:13,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 76 remaining) [2024-10-11 17:17:13,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 76 remaining) [2024-10-11 17:17:13,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 76 remaining) [2024-10-11 17:17:13,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 76 remaining) [2024-10-11 17:17:13,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 76 remaining) [2024-10-11 17:17:13,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 76 remaining) [2024-10-11 17:17:13,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 76 remaining) [2024-10-11 17:17:13,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 76 remaining) [2024-10-11 17:17:13,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 76 remaining) [2024-10-11 17:17:13,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 76 remaining) [2024-10-11 17:17:13,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (33 of 76 remaining) [2024-10-11 17:17:13,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (32 of 76 remaining) [2024-10-11 17:17:13,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 76 remaining) [2024-10-11 17:17:13,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 76 remaining) [2024-10-11 17:17:13,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 76 remaining) [2024-10-11 17:17:13,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 76 remaining) [2024-10-11 17:17:13,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 76 remaining) [2024-10-11 17:17:13,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 76 remaining) [2024-10-11 17:17:13,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 76 remaining) [2024-10-11 17:17:13,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 76 remaining) [2024-10-11 17:17:13,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 76 remaining) [2024-10-11 17:17:13,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 76 remaining) [2024-10-11 17:17:13,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 76 remaining) [2024-10-11 17:17:13,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 76 remaining) [2024-10-11 17:17:13,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (12 of 76 remaining) [2024-10-11 17:17:13,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 76 remaining) [2024-10-11 17:17:13,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (10 of 76 remaining) [2024-10-11 17:17:13,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (9 of 76 remaining) [2024-10-11 17:17:13,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (8 of 76 remaining) [2024-10-11 17:17:13,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 76 remaining) [2024-10-11 17:17:13,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 76 remaining) [2024-10-11 17:17:13,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 76 remaining) [2024-10-11 17:17:13,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 76 remaining) [2024-10-11 17:17:13,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 76 remaining) [2024-10-11 17:17:13,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 76 remaining) [2024-10-11 17:17:13,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 76 remaining) [2024-10-11 17:17:13,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 76 remaining) [2024-10-11 17:17:13,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:17:13,109 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:13,114 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:17:13,114 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:17:13,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:17:13 BasicIcfg [2024-10-11 17:17:13,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:17:13,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:17:13,121 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:17:13,121 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:17:13,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:05" (3/4) ... [2024-10-11 17:17:13,122 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:17:13,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:17:13,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:17:13,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:17:13,130 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-11 17:17:13,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:17:13,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:17:13,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:17:13,220 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:17:13,220 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:17:13,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:17:13,221 INFO L158 Benchmark]: Toolchain (without parser) took 9146.55ms. Allocated memory was 174.1MB in the beginning and 683.7MB in the end (delta: 509.6MB). Free memory was 116.3MB in the beginning and 414.8MB in the end (delta: -298.5MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2024-10-11 17:17:13,222 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:17:13,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.10ms. Allocated memory is still 174.1MB. Free memory was 116.3MB in the beginning and 101.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:17:13,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.14ms. Allocated memory is still 174.1MB. Free memory was 101.6MB in the beginning and 98.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:17:13,223 INFO L158 Benchmark]: Boogie Preprocessor took 67.63ms. Allocated memory is still 174.1MB. Free memory was 98.1MB in the beginning and 95.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:13,223 INFO L158 Benchmark]: RCFGBuilder took 1189.82ms. Allocated memory is still 174.1MB. Free memory was 95.3MB in the beginning and 104.8MB in the end (delta: -9.4MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:13,223 INFO L158 Benchmark]: TraceAbstraction took 7474.63ms. Allocated memory was 174.1MB in the beginning and 683.7MB in the end (delta: 509.6MB). Free memory was 103.7MB in the beginning and 420.0MB in the end (delta: -316.3MB). Peak memory consumption was 193.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:13,223 INFO L158 Benchmark]: Witness Printer took 100.27ms. Allocated memory is still 683.7MB. Free memory was 420.0MB in the beginning and 414.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:13,225 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.09ms. Allocated memory is still 174.1MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.10ms. Allocated memory is still 174.1MB. Free memory was 116.3MB in the beginning and 101.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.14ms. Allocated memory is still 174.1MB. Free memory was 101.6MB in the beginning and 98.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.63ms. Allocated memory is still 174.1MB. Free memory was 98.1MB in the beginning and 95.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1189.82ms. Allocated memory is still 174.1MB. Free memory was 95.3MB in the beginning and 104.8MB in the end (delta: -9.4MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7474.63ms. Allocated memory was 174.1MB in the beginning and 683.7MB in the end (delta: 509.6MB). Free memory was 103.7MB in the beginning and 420.0MB in the end (delta: -316.3MB). Peak memory consumption was 193.3MB. Max. memory is 16.1GB. * Witness Printer took 100.27ms. Allocated memory is still 683.7MB. Free memory was 420.0MB in the beginning and 414.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 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: 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: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 534 locations, 76 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: 7.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 968 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1563 IncrementalHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 195 mSDtfsCounter, 1563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=12, InterpolantAutomatonStates: 69, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1538 NumberOfCodeBlocks, 1538 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 2112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:17:13,253 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