./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-bad-ring.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:59:41,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:59:41,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:59:41,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:59:41,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:59:41,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:59:41,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:59:41,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:59:41,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:59:41,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:59:41,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:59:41,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:59:41,721 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:59:41,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:59:41,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:59:41,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:59:41,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:59:41,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:59:41,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:59:41,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:59:41,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:59:41,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:59:41,725 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:59:41,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:59:41,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:59:41,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:59:41,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:59:41,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:59:41,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:59:41,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:59:41,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:59:41,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:59:41,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:59:41,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:59:41,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:59:41,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:59:41,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:59:41,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:59:41,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:59:41,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:59:41,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:59:41,733 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2024-10-13 09:59:41,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:59:42,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:59:42,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:59:42,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:59:42,024 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:59:42,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2024-10-13 09:59:43,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:59:43,557 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:59:43,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2024-10-13 09:59:43,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b63e601d/9b5006a1fcbe44839e1eb839c4fc9502/FLAG8de2ccb56 [2024-10-13 09:59:43,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b63e601d/9b5006a1fcbe44839e1eb839c4fc9502 [2024-10-13 09:59:43,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:59:43,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:59:43,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:59:43,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:59:43,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:59:43,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:59:43" (1/1) ... [2024-10-13 09:59:43,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6841fda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:43, skipping insertion in model container [2024-10-13 09:59:43,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:59:43" (1/1) ... [2024-10-13 09:59:44,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:59:44,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:59:44,193 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:59:44,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:59:44,270 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:59:44,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44 WrapperNode [2024-10-13 09:59:44,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:59:44,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:59:44,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:59:44,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:59:44,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,353 INFO L138 Inliner]: procedures = 24, calls = 47, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 614 [2024-10-13 09:59:44,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:59:44,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:59:44,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:59:44,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:59:44,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:59:44,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:59:44,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:59:44,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:59:44,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (1/1) ... [2024-10-13 09:59:44,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:59:44,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:59:44,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:59:44,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:59:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:59:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:59:44,485 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:59:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:59:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:59:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:59:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:59:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:59:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:59:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 09:59:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 09:59:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:59:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:59:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:59:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:59:44,488 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:59:44,661 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:59:44,663 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:59:45,327 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:59:45,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:59:45,893 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:59:45,896 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 09:59:45,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:45 BoogieIcfgContainer [2024-10-13 09:59:45,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:59:45,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:59:45,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:59:45,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:59:45,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:59:43" (1/3) ... [2024-10-13 09:59:45,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a1a1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:59:45, skipping insertion in model container [2024-10-13 09:59:45,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:44" (2/3) ... [2024-10-13 09:59:45,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a1a1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:59:45, skipping insertion in model container [2024-10-13 09:59:45,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:45" (3/3) ... [2024-10-13 09:59:45,907 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2024-10-13 09:59:45,924 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:59:45,925 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 90 error locations. [2024-10-13 09:59:45,925 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:59:46,034 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:59:46,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 460 transitions, 941 flow [2024-10-13 09:59:46,240 INFO L124 PetriNetUnfolderBase]: 22/457 cut-off events. [2024-10-13 09:59:46,240 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:59:46,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 457 events. 22/457 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 779 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 405. Up to 3 conditions per place. [2024-10-13 09:59:46,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 448 places, 460 transitions, 941 flow [2024-10-13 09:59:46,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 440 transitions, 898 flow [2024-10-13 09:59:46,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:59:46,281 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;@515326f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:59:46,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2024-10-13 09:59:46,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:59:46,286 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-10-13 09:59:46,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:59:46,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:46,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:46,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2057893164, now seen corresponding path program 1 times [2024-10-13 09:59:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:46,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244634296] [2024-10-13 09:59:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:46,532 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-13 09:59:46,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:46,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244634296] [2024-10-13 09:59:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244634296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:46,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:46,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982632271] [2024-10-13 09:59:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:46,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:46,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:46,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 460 [2024-10-13 09:59:46,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 440 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 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-13 09:59:46,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:46,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 460 [2024-10-13 09:59:46,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:46,871 INFO L124 PetriNetUnfolderBase]: 148/865 cut-off events. [2024-10-13 09:59:46,872 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-13 09:59:46,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 865 events. 148/865 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3659 event pairs, 92 based on Foata normal form. 75/843 useless extension candidates. Maximal degree in co-relation 754. Up to 219 conditions per place. [2024-10-13 09:59:46,880 INFO L140 encePairwiseOnDemand]: 380/460 looper letters, 18 selfloop transitions, 2 changer transitions 7/362 dead transitions. [2024-10-13 09:59:46,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 362 transitions, 782 flow [2024-10-13 09:59:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1175 transitions. [2024-10-13 09:59:46,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2024-10-13 09:59:46,897 INFO L175 Difference]: Start difference. First operand has 429 places, 440 transitions, 898 flow. Second operand 3 states and 1175 transitions. [2024-10-13 09:59:46,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 362 transitions, 782 flow [2024-10-13 09:59:46,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 362 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:59:46,909 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 720 flow [2024-10-13 09:59:46,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2024-10-13 09:59:46,918 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -67 predicate places. [2024-10-13 09:59:46,919 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 720 flow [2024-10-13 09:59:46,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 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-13 09:59:46,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:46,920 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] [2024-10-13 09:59:46,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:59:46,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:46,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash -807083259, now seen corresponding path program 1 times [2024-10-13 09:59:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:46,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503634550] [2024-10-13 09:59:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:46,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:46,993 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-13 09:59:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503634550] [2024-10-13 09:59:46,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503634550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:46,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:46,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353825498] [2024-10-13 09:59:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:47,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:47,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:47,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:47,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:47,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:47,206 INFO L124 PetriNetUnfolderBase]: 135/830 cut-off events. [2024-10-13 09:59:47,207 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:47,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 830 events. 135/830 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3514 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1009. Up to 195 conditions per place. [2024-10-13 09:59:47,212 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2024-10-13 09:59:47,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 354 transitions, 756 flow [2024-10-13 09:59:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-10-13 09:59:47,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-13 09:59:47,215 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 720 flow. Second operand 3 states and 1100 transitions. [2024-10-13 09:59:47,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 354 transitions, 756 flow [2024-10-13 09:59:47,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 354 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:47,221 INFO L231 Difference]: Finished difference. Result has 354 places, 354 transitions, 718 flow [2024-10-13 09:59:47,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=354, PETRI_TRANSITIONS=354} [2024-10-13 09:59:47,222 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -75 predicate places. [2024-10-13 09:59:47,223 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 354 transitions, 718 flow [2024-10-13 09:59:47,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:47,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:47,224 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] [2024-10-13 09:59:47,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:59:47,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:47,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1332953604, now seen corresponding path program 1 times [2024-10-13 09:59:47,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:47,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846213227] [2024-10-13 09:59:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:47,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:47,264 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-13 09:59:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846213227] [2024-10-13 09:59:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846213227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:47,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:47,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728778996] [2024-10-13 09:59:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:47,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:47,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:47,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:47,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 354 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:47,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:47,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:47,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:47,442 INFO L124 PetriNetUnfolderBase]: 135/829 cut-off events. [2024-10-13 09:59:47,443 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:47,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 829 events. 135/829 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3522 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1000. Up to 195 conditions per place. [2024-10-13 09:59:47,448 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2024-10-13 09:59:47,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 353 transitions, 754 flow [2024-10-13 09:59:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-10-13 09:59:47,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-13 09:59:47,451 INFO L175 Difference]: Start difference. First operand has 354 places, 354 transitions, 718 flow. Second operand 3 states and 1100 transitions. [2024-10-13 09:59:47,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 353 transitions, 754 flow [2024-10-13 09:59:47,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 353 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:47,456 INFO L231 Difference]: Finished difference. Result has 353 places, 353 transitions, 716 flow [2024-10-13 09:59:47,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=353, PETRI_TRANSITIONS=353} [2024-10-13 09:59:47,458 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -76 predicate places. [2024-10-13 09:59:47,458 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 353 transitions, 716 flow [2024-10-13 09:59:47,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:47,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:47,459 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] [2024-10-13 09:59:47,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:59:47,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash -643084830, now seen corresponding path program 1 times [2024-10-13 09:59:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538509401] [2024-10-13 09:59:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:47,508 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-13 09:59:47,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:47,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538509401] [2024-10-13 09:59:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538509401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:47,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:47,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:47,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840600090] [2024-10-13 09:59:47,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:47,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:47,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:47,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:47,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:47,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:47,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 353 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:47,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:47,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:47,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:47,730 INFO L124 PetriNetUnfolderBase]: 135/828 cut-off events. [2024-10-13 09:59:47,730 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:47,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 828 events. 135/828 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3538 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 991. Up to 195 conditions per place. [2024-10-13 09:59:47,736 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2024-10-13 09:59:47,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 352 transitions, 752 flow [2024-10-13 09:59:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-10-13 09:59:47,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-13 09:59:47,739 INFO L175 Difference]: Start difference. First operand has 353 places, 353 transitions, 716 flow. Second operand 3 states and 1100 transitions. [2024-10-13 09:59:47,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 352 transitions, 752 flow [2024-10-13 09:59:47,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 352 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:47,744 INFO L231 Difference]: Finished difference. Result has 352 places, 352 transitions, 714 flow [2024-10-13 09:59:47,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=352, PETRI_TRANSITIONS=352} [2024-10-13 09:59:47,745 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2024-10-13 09:59:47,746 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 352 transitions, 714 flow [2024-10-13 09:59:47,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:47,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:47,747 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] [2024-10-13 09:59:47,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:59:47,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:47,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1496676515, now seen corresponding path program 1 times [2024-10-13 09:59:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:47,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549677490] [2024-10-13 09:59:47,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:47,794 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-13 09:59:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549677490] [2024-10-13 09:59:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549677490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773385924] [2024-10-13 09:59:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:47,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:47,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:47,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:47,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-10-13 09:59:47,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 352 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:47,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:47,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-10-13 09:59:47,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:47,987 INFO L124 PetriNetUnfolderBase]: 135/827 cut-off events. [2024-10-13 09:59:47,988 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:47,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 827 events. 135/827 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3533 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 979. Up to 192 conditions per place. [2024-10-13 09:59:47,992 INFO L140 encePairwiseOnDemand]: 458/460 looper letters, 15 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2024-10-13 09:59:47,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 744 flow [2024-10-13 09:59:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2024-10-13 09:59:47,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803623188405797 [2024-10-13 09:59:47,996 INFO L175 Difference]: Start difference. First operand has 352 places, 352 transitions, 714 flow. Second operand 3 states and 1109 transitions. [2024-10-13 09:59:47,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 744 flow [2024-10-13 09:59:47,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 351 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:48,002 INFO L231 Difference]: Finished difference. Result has 351 places, 351 transitions, 710 flow [2024-10-13 09:59:48,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=351, PETRI_TRANSITIONS=351} [2024-10-13 09:59:48,003 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -78 predicate places. [2024-10-13 09:59:48,003 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 351 transitions, 710 flow [2024-10-13 09:59:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:48,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:48,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:59:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:59:48,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:48,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 372795618, now seen corresponding path program 1 times [2024-10-13 09:59:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717554090] [2024-10-13 09:59:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:48,559 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-13 09:59:48,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:48,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717554090] [2024-10-13 09:59:48,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717554090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:48,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:48,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934524577] [2024-10-13 09:59:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:48,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:48,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:48,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 460 [2024-10-13 09:59:48,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 351 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 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-13 09:59:48,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:48,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 460 [2024-10-13 09:59:48,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:48,979 INFO L124 PetriNetUnfolderBase]: 135/824 cut-off events. [2024-10-13 09:59:48,979 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:48,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 824 events. 135/824 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3538 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1012. Up to 215 conditions per place. [2024-10-13 09:59:48,984 INFO L140 encePairwiseOnDemand]: 442/460 looper letters, 37 selfloop transitions, 15 changer transitions 0/348 dead transitions. [2024-10-13 09:59:48,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 808 flow [2024-10-13 09:59:48,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2011 transitions. [2024-10-13 09:59:48,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7286231884057971 [2024-10-13 09:59:48,989 INFO L175 Difference]: Start difference. First operand has 351 places, 351 transitions, 710 flow. Second operand 6 states and 2011 transitions. [2024-10-13 09:59:48,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 348 transitions, 808 flow [2024-10-13 09:59:48,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 348 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:48,996 INFO L231 Difference]: Finished difference. Result has 352 places, 348 transitions, 733 flow [2024-10-13 09:59:48,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=352, PETRI_TRANSITIONS=348} [2024-10-13 09:59:48,998 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2024-10-13 09:59:48,998 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 348 transitions, 733 flow [2024-10-13 09:59:48,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 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-13 09:59:48,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:49,000 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] [2024-10-13 09:59:49,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:59:49,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:49,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1759250594, now seen corresponding path program 1 times [2024-10-13 09:59:49,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:49,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589109384] [2024-10-13 09:59:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:49,049 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-13 09:59:49,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:49,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589109384] [2024-10-13 09:59:49,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589109384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:49,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:49,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101926490] [2024-10-13 09:59:49,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:49,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:49,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:49,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:49,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-10-13 09:59:49,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 348 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:49,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:49,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-10-13 09:59:49,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:49,187 INFO L124 PetriNetUnfolderBase]: 135/823 cut-off events. [2024-10-13 09:59:49,187 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:49,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 823 events. 135/823 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3535 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1006. Up to 194 conditions per place. [2024-10-13 09:59:49,192 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 16 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2024-10-13 09:59:49,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 347 transitions, 767 flow [2024-10-13 09:59:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-10-13 09:59:49,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-10-13 09:59:49,195 INFO L175 Difference]: Start difference. First operand has 352 places, 348 transitions, 733 flow. Second operand 3 states and 1102 transitions. [2024-10-13 09:59:49,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 347 transitions, 767 flow [2024-10-13 09:59:49,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 347 transitions, 737 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:59:49,204 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 705 flow [2024-10-13 09:59:49,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2024-10-13 09:59:49,206 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -81 predicate places. [2024-10-13 09:59:49,206 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 705 flow [2024-10-13 09:59:49,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:49,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:49,208 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] [2024-10-13 09:59:49,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:59:49,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:49,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 396484117, now seen corresponding path program 1 times [2024-10-13 09:59:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:49,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173562300] [2024-10-13 09:59:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:49,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:49,244 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-13 09:59:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173562300] [2024-10-13 09:59:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173562300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:49,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877922035] [2024-10-13 09:59:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:49,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:49,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-10-13 09:59:49,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:49,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:49,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-10-13 09:59:49,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:49,372 INFO L124 PetriNetUnfolderBase]: 135/822 cut-off events. [2024-10-13 09:59:49,373 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:49,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 822 events. 135/822 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3534 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 192 conditions per place. [2024-10-13 09:59:49,376 INFO L140 encePairwiseOnDemand]: 458/460 looper letters, 15 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2024-10-13 09:59:49,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 346 transitions, 735 flow [2024-10-13 09:59:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2024-10-13 09:59:49,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803623188405797 [2024-10-13 09:59:49,378 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 705 flow. Second operand 3 states and 1109 transitions. [2024-10-13 09:59:49,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 346 transitions, 735 flow [2024-10-13 09:59:49,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 346 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:49,382 INFO L231 Difference]: Finished difference. Result has 347 places, 346 transitions, 701 flow [2024-10-13 09:59:49,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=347, PETRI_TRANSITIONS=346} [2024-10-13 09:59:49,385 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2024-10-13 09:59:49,386 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 346 transitions, 701 flow [2024-10-13 09:59:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:49,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:49,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:49,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:59:49,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:49,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1682379237, now seen corresponding path program 1 times [2024-10-13 09:59:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:49,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121228848] [2024-10-13 09:59:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:49,424 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-13 09:59:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121228848] [2024-10-13 09:59:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121228848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:49,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:49,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041441561] [2024-10-13 09:59:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:49,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-10-13 09:59:49,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 346 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:49,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:49,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-10-13 09:59:49,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:49,556 INFO L124 PetriNetUnfolderBase]: 135/821 cut-off events. [2024-10-13 09:59:49,557 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:49,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 821 events. 135/821 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3493 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 194 conditions per place. [2024-10-13 09:59:49,562 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 16 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2024-10-13 09:59:49,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 735 flow [2024-10-13 09:59:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-10-13 09:59:49,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-10-13 09:59:49,564 INFO L175 Difference]: Start difference. First operand has 347 places, 346 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2024-10-13 09:59:49,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 735 flow [2024-10-13 09:59:49,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 345 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:49,569 INFO L231 Difference]: Finished difference. Result has 347 places, 345 transitions, 702 flow [2024-10-13 09:59:49,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=347, PETRI_TRANSITIONS=345} [2024-10-13 09:59:49,570 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2024-10-13 09:59:49,570 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 345 transitions, 702 flow [2024-10-13 09:59:49,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:49,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:49,571 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] [2024-10-13 09:59:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:59:49,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:49,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash 509013339, now seen corresponding path program 1 times [2024-10-13 09:59:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425824356] [2024-10-13 09:59:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:49,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:49,608 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-13 09:59:49,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:49,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425824356] [2024-10-13 09:59:49,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425824356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:49,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:49,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708581339] [2024-10-13 09:59:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:49,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:49,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:49,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-10-13 09:59:49,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 345 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:49,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:49,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-10-13 09:59:49,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:49,738 INFO L124 PetriNetUnfolderBase]: 135/820 cut-off events. [2024-10-13 09:59:49,739 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 820 events. 135/820 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3491 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 192 conditions per place. [2024-10-13 09:59:49,743 INFO L140 encePairwiseOnDemand]: 458/460 looper letters, 15 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2024-10-13 09:59:49,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 344 transitions, 732 flow [2024-10-13 09:59:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2024-10-13 09:59:49,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803623188405797 [2024-10-13 09:59:49,745 INFO L175 Difference]: Start difference. First operand has 347 places, 345 transitions, 702 flow. Second operand 3 states and 1109 transitions. [2024-10-13 09:59:49,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 344 transitions, 732 flow [2024-10-13 09:59:49,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:49,749 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 698 flow [2024-10-13 09:59:49,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2024-10-13 09:59:49,750 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2024-10-13 09:59:49,751 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 698 flow [2024-10-13 09:59:49,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:49,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:49,752 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:49,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:59:49,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash -86622875, now seen corresponding path program 1 times [2024-10-13 09:59:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:49,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443994015] [2024-10-13 09:59:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:49,789 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-13 09:59:49,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:49,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443994015] [2024-10-13 09:59:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443994015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:49,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:49,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399859783] [2024-10-13 09:59:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:49,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:49,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-10-13 09:59:49,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:49,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:49,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-10-13 09:59:49,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:49,906 INFO L124 PetriNetUnfolderBase]: 135/819 cut-off events. [2024-10-13 09:59:49,906 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:49,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 819 events. 135/819 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3486 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 194 conditions per place. [2024-10-13 09:59:49,911 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 16 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2024-10-13 09:59:49,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 343 transitions, 732 flow [2024-10-13 09:59:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-10-13 09:59:49,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-10-13 09:59:49,913 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 698 flow. Second operand 3 states and 1102 transitions. [2024-10-13 09:59:49,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 343 transitions, 732 flow [2024-10-13 09:59:49,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 343 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:49,917 INFO L231 Difference]: Finished difference. Result has 346 places, 343 transitions, 699 flow [2024-10-13 09:59:49,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=346, PETRI_TRANSITIONS=343} [2024-10-13 09:59:49,918 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2024-10-13 09:59:49,918 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 343 transitions, 699 flow [2024-10-13 09:59:49,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:49,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:49,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:49,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:59:49,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:49,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1786793926, now seen corresponding path program 1 times [2024-10-13 09:59:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:49,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160342917] [2024-10-13 09:59:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:49,957 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-13 09:59:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160342917] [2024-10-13 09:59:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160342917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:49,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:49,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099161489] [2024-10-13 09:59:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:49,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:49,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:49,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:49,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 343 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:49,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:49,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:49,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:50,103 INFO L124 PetriNetUnfolderBase]: 135/818 cut-off events. [2024-10-13 09:59:50,103 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:50,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 818 events. 135/818 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3487 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 976. Up to 195 conditions per place. [2024-10-13 09:59:50,107 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2024-10-13 09:59:50,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 735 flow [2024-10-13 09:59:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-10-13 09:59:50,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-13 09:59:50,110 INFO L175 Difference]: Start difference. First operand has 346 places, 343 transitions, 699 flow. Second operand 3 states and 1100 transitions. [2024-10-13 09:59:50,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 735 flow [2024-10-13 09:59:50,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 342 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:50,115 INFO L231 Difference]: Finished difference. Result has 345 places, 342 transitions, 697 flow [2024-10-13 09:59:50,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=345, PETRI_TRANSITIONS=342} [2024-10-13 09:59:50,116 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -84 predicate places. [2024-10-13 09:59:50,116 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 342 transitions, 697 flow [2024-10-13 09:59:50,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:50,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:50,117 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:50,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:59:50,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:50,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash -415536618, now seen corresponding path program 1 times [2024-10-13 09:59:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:50,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991944693] [2024-10-13 09:59:50,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:50,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:50,163 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-13 09:59:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991944693] [2024-10-13 09:59:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991944693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:50,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527673889] [2024-10-13 09:59:50,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:50,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:50,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:50,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:50,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 342 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:50,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:50,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:50,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:50,320 INFO L124 PetriNetUnfolderBase]: 135/817 cut-off events. [2024-10-13 09:59:50,320 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:50,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 817 events. 135/817 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3484 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 195 conditions per place. [2024-10-13 09:59:50,326 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2024-10-13 09:59:50,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 341 transitions, 733 flow [2024-10-13 09:59:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-10-13 09:59:50,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-13 09:59:50,329 INFO L175 Difference]: Start difference. First operand has 345 places, 342 transitions, 697 flow. Second operand 3 states and 1100 transitions. [2024-10-13 09:59:50,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 341 transitions, 733 flow [2024-10-13 09:59:50,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 341 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:50,333 INFO L231 Difference]: Finished difference. Result has 344 places, 341 transitions, 695 flow [2024-10-13 09:59:50,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=344, PETRI_TRANSITIONS=341} [2024-10-13 09:59:50,334 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -85 predicate places. [2024-10-13 09:59:50,334 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 341 transitions, 695 flow [2024-10-13 09:59:50,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:50,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:50,336 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:50,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:59:50,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:50,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1119558372, now seen corresponding path program 1 times [2024-10-13 09:59:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651977238] [2024-10-13 09:59:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:50,386 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-13 09:59:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651977238] [2024-10-13 09:59:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651977238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:50,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:50,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210226619] [2024-10-13 09:59:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:50,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:50,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:50,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:50,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 341 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:50,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:50,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:50,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:50,508 INFO L124 PetriNetUnfolderBase]: 135/816 cut-off events. [2024-10-13 09:59:50,508 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:50,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 816 events. 135/816 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3484 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 195 conditions per place. [2024-10-13 09:59:50,513 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2024-10-13 09:59:50,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 340 transitions, 731 flow [2024-10-13 09:59:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-10-13 09:59:50,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-13 09:59:50,515 INFO L175 Difference]: Start difference. First operand has 344 places, 341 transitions, 695 flow. Second operand 3 states and 1100 transitions. [2024-10-13 09:59:50,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 340 transitions, 731 flow [2024-10-13 09:59:50,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 340 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:50,519 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 693 flow [2024-10-13 09:59:50,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2024-10-13 09:59:50,520 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-10-13 09:59:50,520 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 693 flow [2024-10-13 09:59:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:50,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:50,521 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:50,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:59:50,522 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash -344290931, now seen corresponding path program 1 times [2024-10-13 09:59:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893759315] [2024-10-13 09:59:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:50,560 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-13 09:59:50,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:50,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893759315] [2024-10-13 09:59:50,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893759315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:50,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:50,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:50,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593649380] [2024-10-13 09:59:50,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:50,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:50,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:50,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:50,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:50,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-10-13 09:59:50,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:50,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:50,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-10-13 09:59:50,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:50,684 INFO L124 PetriNetUnfolderBase]: 127/717 cut-off events. [2024-10-13 09:59:50,684 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 09:59:50,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 717 events. 127/717 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2662 event pairs, 14 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 868. Up to 141 conditions per place. [2024-10-13 09:59:50,690 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 22 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2024-10-13 09:59:50,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 757 flow [2024-10-13 09:59:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2024-10-13 09:59:50,693 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8094202898550724 [2024-10-13 09:59:50,693 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 693 flow. Second operand 3 states and 1117 transitions. [2024-10-13 09:59:50,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 757 flow [2024-10-13 09:59:50,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:50,699 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 697 flow [2024-10-13 09:59:50,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2024-10-13 09:59:50,700 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-10-13 09:59:50,701 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 697 flow [2024-10-13 09:59:50,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:50,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:50,702 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:50,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:59:50,702 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:50,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:50,703 INFO L85 PathProgramCache]: Analyzing trace with hash 875678034, now seen corresponding path program 1 times [2024-10-13 09:59:50,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:50,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625004964] [2024-10-13 09:59:50,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:50,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:50,747 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-13 09:59:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625004964] [2024-10-13 09:59:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625004964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006823157] [2024-10-13 09:59:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:50,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-10-13 09:59:50,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:50,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:50,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-10-13 09:59:50,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:50,867 INFO L124 PetriNetUnfolderBase]: 136/821 cut-off events. [2024-10-13 09:59:50,867 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-13 09:59:50,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 821 events. 136/821 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3576 event pairs, 74 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 1038. Up to 198 conditions per place. [2024-10-13 09:59:50,872 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2024-10-13 09:59:50,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 733 flow [2024-10-13 09:59:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-10-13 09:59:50,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-10-13 09:59:50,874 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 697 flow. Second operand 3 states and 1102 transitions. [2024-10-13 09:59:50,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 733 flow [2024-10-13 09:59:50,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 339 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:50,878 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 697 flow [2024-10-13 09:59:50,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2024-10-13 09:59:50,879 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-10-13 09:59:50,879 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 697 flow [2024-10-13 09:59:50,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:50,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:50,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:59:50,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:59:50,881 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash -305279223, now seen corresponding path program 1 times [2024-10-13 09:59:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073181806] [2024-10-13 09:59:50,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:50,921 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-13 09:59:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073181806] [2024-10-13 09:59:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073181806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175649258] [2024-10-13 09:59:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:50,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:50,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:50,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-10-13 09:59:50,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:50,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:50,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-10-13 09:59:50,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:51,065 INFO L124 PetriNetUnfolderBase]: 137/782 cut-off events. [2024-10-13 09:59:51,065 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-10-13 09:59:51,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 782 events. 137/782 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3168 event pairs, 28 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 985. Up to 119 conditions per place. [2024-10-13 09:59:51,069 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 24 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2024-10-13 09:59:51,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 771 flow [2024-10-13 09:59:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2024-10-13 09:59:51,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8094202898550724 [2024-10-13 09:59:51,072 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 697 flow. Second operand 3 states and 1117 transitions. [2024-10-13 09:59:51,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 771 flow [2024-10-13 09:59:51,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:51,076 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 701 flow [2024-10-13 09:59:51,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2024-10-13 09:59:51,076 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-10-13 09:59:51,077 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 701 flow [2024-10-13 09:59:51,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:51,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:51,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:51,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:59:51,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1473824724, now seen corresponding path program 1 times [2024-10-13 09:59:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923780631] [2024-10-13 09:59:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:51,122 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-13 09:59:51,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:51,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923780631] [2024-10-13 09:59:51,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923780631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:51,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646317448] [2024-10-13 09:59:51,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:51,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:51,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:51,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-10-13 09:59:51,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:51,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:51,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-10-13 09:59:51,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:51,248 INFO L124 PetriNetUnfolderBase]: 137/826 cut-off events. [2024-10-13 09:59:51,248 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-13 09:59:51,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 826 events. 137/826 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3619 event pairs, 74 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1077. Up to 202 conditions per place. [2024-10-13 09:59:51,254 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 18 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2024-10-13 09:59:51,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 338 transitions, 739 flow [2024-10-13 09:59:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-10-13 09:59:51,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-10-13 09:59:51,257 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2024-10-13 09:59:51,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 338 transitions, 739 flow [2024-10-13 09:59:51,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 338 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:51,261 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 701 flow [2024-10-13 09:59:51,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2024-10-13 09:59:51,262 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-10-13 09:59:51,262 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 701 flow [2024-10-13 09:59:51,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:51,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:51,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:59:51,264 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:51,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 740267762, now seen corresponding path program 1 times [2024-10-13 09:59:51,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:51,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569700034] [2024-10-13 09:59:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:51,306 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-13 09:59:51,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569700034] [2024-10-13 09:59:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569700034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:51,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:51,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28176146] [2024-10-13 09:59:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:51,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:51,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-10-13 09:59:51,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:51,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:51,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-10-13 09:59:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:51,485 INFO L124 PetriNetUnfolderBase]: 196/990 cut-off events. [2024-10-13 09:59:51,485 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-10-13 09:59:51,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 990 events. 196/990 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4783 event pairs, 56 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1375. Up to 163 conditions per place. [2024-10-13 09:59:51,489 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 30 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2024-10-13 09:59:51,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 351 transitions, 804 flow [2024-10-13 09:59:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1121 transitions. [2024-10-13 09:59:51,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8123188405797102 [2024-10-13 09:59:51,492 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 701 flow. Second operand 3 states and 1121 transitions. [2024-10-13 09:59:51,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 351 transitions, 804 flow [2024-10-13 09:59:51,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 351 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:51,496 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 705 flow [2024-10-13 09:59:51,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2024-10-13 09:59:51,497 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-10-13 09:59:51,497 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 705 flow [2024-10-13 09:59:51,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-13 09:59:51,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:51,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:51,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:59:51,498 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:51,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1467867554, now seen corresponding path program 1 times [2024-10-13 09:59:51,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:51,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357776515] [2024-10-13 09:59:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:51,535 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-13 09:59:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357776515] [2024-10-13 09:59:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357776515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:51,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806635633] [2024-10-13 09:59:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:51,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:51,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:51,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:51,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-10-13 09:59:51,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:51,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:51,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-10-13 09:59:51,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:51,682 INFO L124 PetriNetUnfolderBase]: 196/1004 cut-off events. [2024-10-13 09:59:51,682 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2024-10-13 09:59:51,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1004 events. 196/1004 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4847 event pairs, 124 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1428. Up to 301 conditions per place. [2024-10-13 09:59:51,688 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 19 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2024-10-13 09:59:51,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 337 transitions, 745 flow [2024-10-13 09:59:51,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-10-13 09:59:51,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-10-13 09:59:51,690 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 705 flow. Second operand 3 states and 1102 transitions. [2024-10-13 09:59:51,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 337 transitions, 745 flow [2024-10-13 09:59:51,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 337 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:51,695 INFO L231 Difference]: Finished difference. Result has 343 places, 337 transitions, 705 flow [2024-10-13 09:59:51,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=337} [2024-10-13 09:59:51,696 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-10-13 09:59:51,696 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 337 transitions, 705 flow [2024-10-13 09:59:51,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-13 09:59:51,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:51,697 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:59:51,697 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2112773445, now seen corresponding path program 1 times [2024-10-13 09:59:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219805918] [2024-10-13 09:59:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:59:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219805918] [2024-10-13 09:59:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219805918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:51,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534384556] [2024-10-13 09:59:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:51,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:51,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:51,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:51,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-10-13 09:59:51,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 337 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 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-13 09:59:51,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:51,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-10-13 09:59:51,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:51,972 INFO L124 PetriNetUnfolderBase]: 296/1261 cut-off events. [2024-10-13 09:59:51,972 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-13 09:59:51,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 1261 events. 296/1261 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6757 event pairs, 196 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1896. Up to 451 conditions per place. [2024-10-13 09:59:51,980 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 20 selfloop transitions, 1 changer transitions 0/335 dead transitions. [2024-10-13 09:59:51,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 335 transitions, 743 flow [2024-10-13 09:59:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2024-10-13 09:59:51,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7992753623188406 [2024-10-13 09:59:51,983 INFO L175 Difference]: Start difference. First operand has 343 places, 337 transitions, 705 flow. Second operand 3 states and 1103 transitions. [2024-10-13 09:59:51,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 335 transitions, 743 flow [2024-10-13 09:59:51,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 335 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:51,988 INFO L231 Difference]: Finished difference. Result has 341 places, 335 transitions, 699 flow [2024-10-13 09:59:51,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=341, PETRI_TRANSITIONS=335} [2024-10-13 09:59:51,989 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2024-10-13 09:59:51,989 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 335 transitions, 699 flow [2024-10-13 09:59:51,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 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-13 09:59:51,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:51,989 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:51,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:59:51,990 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash -374015194, now seen corresponding path program 1 times [2024-10-13 09:59:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170125859] [2024-10-13 09:59:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:52,043 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-13 09:59:52,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170125859] [2024-10-13 09:59:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170125859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:52,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999662561] [2024-10-13 09:59:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:52,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:52,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:52,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:52,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:52,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 335 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:52,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:52,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:52,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:52,252 INFO L124 PetriNetUnfolderBase]: 346/1327 cut-off events. [2024-10-13 09:59:52,252 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2024-10-13 09:59:52,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 1327 events. 346/1327 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7177 event pairs, 196 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2073. Up to 452 conditions per place. [2024-10-13 09:59:52,259 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 29 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2024-10-13 09:59:52,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 785 flow [2024-10-13 09:59:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2024-10-13 09:59:52,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8021739130434783 [2024-10-13 09:59:52,262 INFO L175 Difference]: Start difference. First operand has 341 places, 335 transitions, 699 flow. Second operand 3 states and 1107 transitions. [2024-10-13 09:59:52,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 785 flow [2024-10-13 09:59:52,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:52,266 INFO L231 Difference]: Finished difference. Result has 341 places, 334 transitions, 700 flow [2024-10-13 09:59:52,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=341, PETRI_TRANSITIONS=334} [2024-10-13 09:59:52,267 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2024-10-13 09:59:52,267 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 334 transitions, 700 flow [2024-10-13 09:59:52,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-13 09:59:52,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:52,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:52,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:59:52,268 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:52,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2110388512, now seen corresponding path program 1 times [2024-10-13 09:59:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:52,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900355571] [2024-10-13 09:59:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:52,316 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-13 09:59:52,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:52,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900355571] [2024-10-13 09:59:52,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900355571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:52,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:52,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:52,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102548441] [2024-10-13 09:59:52,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:52,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:52,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:52,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:52,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:52,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:52,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 334 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 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-13 09:59:52,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:52,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:52,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:52,521 INFO L124 PetriNetUnfolderBase]: 296/1175 cut-off events. [2024-10-13 09:59:52,521 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2024-10-13 09:59:52,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1175 events. 296/1175 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5884 event pairs, 160 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 1823. Up to 374 conditions per place. [2024-10-13 09:59:52,526 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 22 selfloop transitions, 2 changer transitions 7/340 dead transitions. [2024-10-13 09:59:52,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 340 transitions, 780 flow [2024-10-13 09:59:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2024-10-13 09:59:52,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8014492753623188 [2024-10-13 09:59:52,529 INFO L175 Difference]: Start difference. First operand has 341 places, 334 transitions, 700 flow. Second operand 3 states and 1106 transitions. [2024-10-13 09:59:52,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 340 transitions, 780 flow [2024-10-13 09:59:52,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 340 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:52,533 INFO L231 Difference]: Finished difference. Result has 339 places, 325 transitions, 679 flow [2024-10-13 09:59:52,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=339, PETRI_TRANSITIONS=325} [2024-10-13 09:59:52,533 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -90 predicate places. [2024-10-13 09:59:52,534 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 325 transitions, 679 flow [2024-10-13 09:59:52,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 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-13 09:59:52,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:52,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:52,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 09:59:52,535 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-10-13 09:59:52,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:52,535 INFO L85 PathProgramCache]: Analyzing trace with hash -603848605, now seen corresponding path program 1 times [2024-10-13 09:59:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:52,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972538920] [2024-10-13 09:59:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:52,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:52,585 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-13 09:59:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972538920] [2024-10-13 09:59:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972538920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:52,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:52,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368641895] [2024-10-13 09:59:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:52,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:52,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:52,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-10-13 09:59:52,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 325 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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-13 09:59:52,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:52,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-10-13 09:59:52,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:52,745 INFO L124 PetriNetUnfolderBase]: 254/990 cut-off events. [2024-10-13 09:59:52,745 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-10-13 09:59:52,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 990 events. 254/990 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4382 event pairs, 132 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1552. Up to 306 conditions per place. [2024-10-13 09:59:52,749 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 0 selfloop transitions, 0 changer transitions 332/332 dead transitions. [2024-10-13 09:59:52,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 332 transitions, 755 flow [2024-10-13 09:59:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-10-13 09:59:52,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-10-13 09:59:52,751 INFO L175 Difference]: Start difference. First operand has 339 places, 325 transitions, 679 flow. Second operand 3 states and 1102 transitions. [2024-10-13 09:59:52,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 332 transitions, 755 flow [2024-10-13 09:59:52,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 332 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:52,755 INFO L231 Difference]: Finished difference. Result has 331 places, 0 transitions, 0 flow [2024-10-13 09:59:52,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=331, PETRI_TRANSITIONS=0} [2024-10-13 09:59:52,755 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -98 predicate places. [2024-10-13 09:59:52,755 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 0 transitions, 0 flow [2024-10-13 09:59:52,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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-13 09:59:52,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining) [2024-10-13 09:59:52,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining) [2024-10-13 09:59:52,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining) [2024-10-13 09:59:52,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining) [2024-10-13 09:59:52,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining) [2024-10-13 09:59:52,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining) [2024-10-13 09:59:52,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining) [2024-10-13 09:59:52,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining) [2024-10-13 09:59:52,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining) [2024-10-13 09:59:52,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining) [2024-10-13 09:59:52,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining) [2024-10-13 09:59:52,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining) [2024-10-13 09:59:52,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining) [2024-10-13 09:59:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining) [2024-10-13 09:59:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining) [2024-10-13 09:59:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining) [2024-10-13 09:59:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining) [2024-10-13 09:59:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining) [2024-10-13 09:59:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining) [2024-10-13 09:59:52,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining) [2024-10-13 09:59:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining) [2024-10-13 09:59:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining) [2024-10-13 09:59:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining) [2024-10-13 09:59:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining) [2024-10-13 09:59:52,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining) [2024-10-13 09:59:52,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 09:59:52,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:52,778 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:59:52,778 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:59:52,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:59:52 BasicIcfg [2024-10-13 09:59:52,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:59:52,783 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:59:52,783 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:59:52,783 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:59:52,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:45" (3/4) ... [2024-10-13 09:59:52,785 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:59:52,788 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:59:52,788 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:59:52,788 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 09:59:52,793 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-10-13 09:59:52,794 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:59:52,794 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:59:52,795 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:59:52,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:59:52,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:59:52,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:59:52,881 INFO L158 Benchmark]: Toolchain (without parser) took 8920.05ms. Allocated memory was 197.1MB in the beginning and 568.3MB in the end (delta: 371.2MB). Free memory was 150.2MB in the beginning and 217.3MB in the end (delta: -67.1MB). Peak memory consumption was 305.0MB. Max. memory is 16.1GB. [2024-10-13 09:59:52,881 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 98.6MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:59:52,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.81ms. Allocated memory is still 197.1MB. Free memory was 150.1MB in the beginning and 134.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 09:59:52,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.13ms. Allocated memory is still 197.1MB. Free memory was 134.4MB in the beginning and 130.1MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 09:59:52,882 INFO L158 Benchmark]: Boogie Preprocessor took 49.47ms. Allocated memory is still 197.1MB. Free memory was 130.1MB in the beginning and 126.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 09:59:52,882 INFO L158 Benchmark]: RCFGBuilder took 1489.05ms. Allocated memory was 197.1MB in the beginning and 268.4MB in the end (delta: 71.3MB). Free memory was 126.2MB in the beginning and 168.7MB in the end (delta: -42.5MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2024-10-13 09:59:52,882 INFO L158 Benchmark]: TraceAbstraction took 6884.04ms. Allocated memory was 268.4MB in the beginning and 568.3MB in the end (delta: 299.9MB). Free memory was 167.7MB in the beginning and 225.7MB in the end (delta: -58.1MB). Peak memory consumption was 242.9MB. Max. memory is 16.1GB. [2024-10-13 09:59:52,882 INFO L158 Benchmark]: Witness Printer took 97.12ms. Allocated memory is still 568.3MB. Free memory was 225.7MB in the beginning and 217.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 09:59:52,883 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.12ms. Allocated memory is still 98.6MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.81ms. Allocated memory is still 197.1MB. Free memory was 150.1MB in the beginning and 134.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.13ms. Allocated memory is still 197.1MB. Free memory was 134.4MB in the beginning and 130.1MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.47ms. Allocated memory is still 197.1MB. Free memory was 130.1MB in the beginning and 126.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1489.05ms. Allocated memory was 197.1MB in the beginning and 268.4MB in the end (delta: 71.3MB). Free memory was 126.2MB in the beginning and 168.7MB in the end (delta: -42.5MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6884.04ms. Allocated memory was 268.4MB in the beginning and 568.3MB in the end (delta: 299.9MB). Free memory was 167.7MB in the beginning and 225.7MB in the end (delta: -58.1MB). Peak memory consumption was 242.9MB. Max. memory is 16.1GB. * Witness Printer took 97.12ms. Allocated memory is still 568.3MB. Free memory was 225.7MB in the beginning and 217.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: 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, 557 locations, 159 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: 6.7s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1095 IncrementalHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 77 mSDtfsCounter, 1095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=898occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3487 NumberOfCodeBlocks, 3487 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3463 ConstructedInterpolants, 0 QuantifiedInterpolants, 3624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 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 90 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:59:52,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE