./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.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 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:01:15,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:01:15,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:01:15,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:01:15,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:01:15,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:01:15,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:01:15,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:01:15,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:01:15,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:01:15,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:01:15,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:01:15,305 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:01:15,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:01:15,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:01:15,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:01:15,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:01:15,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:01:15,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:01:15,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:01:15,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:01:15,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:01:15,307 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:01:15,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:01:15,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:01:15,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:01:15,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:01:15,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:01:15,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:01:15,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:01:15,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:01:15,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:15,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:01:15,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:01:15,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:01:15,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:01:15,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:01:15,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:01:15,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:01:15,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:01:15,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:01:15,311 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 -> 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f [2024-11-09 07:01:15,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:01:15,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:01:15,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:01:15,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:01:15,494 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:01:15,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2024-11-09 07:01:17,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:01:17,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:01:17,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2024-11-09 07:01:17,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12bb11227/ba9b125bd83448eb8c7e72cef2964b80/FLAGc2b8ef354 [2024-11-09 07:01:17,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12bb11227/ba9b125bd83448eb8c7e72cef2964b80 [2024-11-09 07:01:17,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:01:17,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:01:17,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:17,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:01:17,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:01:17,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:17,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7152c30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17, skipping insertion in model container [2024-11-09 07:01:17,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:17,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:01:17,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:17,916 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:01:17,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:17,960 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:01:17,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17 WrapperNode [2024-11-09 07:01:17,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:17,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:17,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:01:17,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:01:17,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:17,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,015 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 619 [2024-11-09 07:01:18,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:18,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:01:18,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:01:18,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:01:18,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:01:18,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:01:18,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:01:18,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:01:18,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (1/1) ... [2024-11-09 07:01:18,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:01:18,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:01:18,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:01:18,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:01:18,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:01:18,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:01:18,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:01:18,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:01:18,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:01:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:01:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 07:01:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 07:01:18,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:01:18,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:01:18,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:01:18,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:01:18,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:01:18,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:01:18,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:01:18,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:01:18,199 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:01:18,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:01:18,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:01:18,990 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:01:18,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:01:19,475 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:01:19,475 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 07:01:19,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:19 BoogieIcfgContainer [2024-11-09 07:01:19,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:01:19,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:01:19,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:01:19,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:01:19,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:01:17" (1/3) ... [2024-11-09 07:01:19,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e139655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:19, skipping insertion in model container [2024-11-09 07:01:19,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:17" (2/3) ... [2024-11-09 07:01:19,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e139655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:19, skipping insertion in model container [2024-11-09 07:01:19,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:19" (3/3) ... [2024-11-09 07:01:19,489 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2024-11-09 07:01:19,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:01:19,519 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 95 error locations. [2024-11-09 07:01:19,519 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:01:19,725 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 07:01:19,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 433 places, 443 transitions, 914 flow [2024-11-09 07:01:19,976 INFO L124 PetriNetUnfolderBase]: 23/439 cut-off events. [2024-11-09 07:01:19,976 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:01:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 439 events. 23/439 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 656 event pairs, 0 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 390. Up to 2 conditions per place. [2024-11-09 07:01:19,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 433 places, 443 transitions, 914 flow [2024-11-09 07:01:19,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 413 places, 422 transitions, 868 flow [2024-11-09 07:01:20,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:01:20,015 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;@5a05200d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:01:20,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 169 error locations. [2024-11-09 07:01:20,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:01:20,023 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-09 07:01:20,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:01:20,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:20,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:20,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:20,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1699402533, now seen corresponding path program 1 times [2024-11-09 07:01:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679345765] [2024-11-09 07:01:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:20,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679345765] [2024-11-09 07:01:20,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679345765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:20,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:20,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:20,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928685615] [2024-11-09 07:01:20,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:20,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:20,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 443 [2024-11-09 07:01:20,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 422 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:20,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:20,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 443 [2024-11-09 07:01:20,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:20,885 INFO L124 PetriNetUnfolderBase]: 748/1716 cut-off events. [2024-11-09 07:01:20,886 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-11-09 07:01:20,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 1716 events. 748/1716 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8822 event pairs, 485 based on Foata normal form. 265/1814 useless extension candidates. Maximal degree in co-relation 2496. Up to 1009 conditions per place. [2024-11-09 07:01:20,900 INFO L140 encePairwiseOnDemand]: 358/443 looper letters, 27 selfloop transitions, 2 changer transitions 6/339 dead transitions. [2024-11-09 07:01:20,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 760 flow [2024-11-09 07:01:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2024-11-09 07:01:20,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8246802106847254 [2024-11-09 07:01:20,919 INFO L175 Difference]: Start difference. First operand has 413 places, 422 transitions, 868 flow. Second operand 3 states and 1096 transitions. [2024-11-09 07:01:20,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 760 flow [2024-11-09 07:01:20,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 339 transitions, 744 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 07:01:20,931 INFO L231 Difference]: Finished difference. Result has 336 places, 333 transitions, 678 flow [2024-11-09 07:01:20,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=334, 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=678, PETRI_PLACES=336, PETRI_TRANSITIONS=333} [2024-11-09 07:01:20,937 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -77 predicate places. [2024-11-09 07:01:20,939 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 333 transitions, 678 flow [2024-11-09 07:01:20,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:20,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:20,939 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] [2024-11-09 07:01:20,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:01:20,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:20,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1622384186, now seen corresponding path program 1 times [2024-11-09 07:01:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:20,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870446039] [2024-11-09 07:01:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870446039] [2024-11-09 07:01:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870446039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193341567] [2024-11-09 07:01:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:21,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:21,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 443 [2024-11-09 07:01:21,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 333 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:21,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:21,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 443 [2024-11-09 07:01:21,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:21,539 INFO L124 PetriNetUnfolderBase]: 748/1709 cut-off events. [2024-11-09 07:01:21,539 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:21,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1709 events. 748/1709 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8771 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2753. Up to 1009 conditions per place. [2024-11-09 07:01:21,546 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 27 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2024-11-09 07:01:21,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 332 transitions, 734 flow [2024-11-09 07:01:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-09 07:01:21,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7629796839729119 [2024-11-09 07:01:21,548 INFO L175 Difference]: Start difference. First operand has 336 places, 333 transitions, 678 flow. Second operand 3 states and 1014 transitions. [2024-11-09 07:01:21,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 332 transitions, 734 flow [2024-11-09 07:01:21,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:21,553 INFO L231 Difference]: Finished difference. Result has 329 places, 332 transitions, 676 flow [2024-11-09 07:01:21,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=327, 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=676, PETRI_PLACES=329, PETRI_TRANSITIONS=332} [2024-11-09 07:01:21,554 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -84 predicate places. [2024-11-09 07:01:21,554 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 332 transitions, 676 flow [2024-11-09 07:01:21,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:21,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:21,555 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] [2024-11-09 07:01:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:01:21,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:21,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:21,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1822750990, now seen corresponding path program 1 times [2024-11-09 07:01:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:21,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667611383] [2024-11-09 07:01:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:21,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667611383] [2024-11-09 07:01:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667611383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580927409] [2024-11-09 07:01:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:21,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:21,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 443 [2024-11-09 07:01:21,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 332 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:21,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:21,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 443 [2024-11-09 07:01:21,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:21,893 INFO L124 PetriNetUnfolderBase]: 748/1708 cut-off events. [2024-11-09 07:01:21,893 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:21,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1708 events. 748/1708 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8782 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2743. Up to 1008 conditions per place. [2024-11-09 07:01:21,903 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2024-11-09 07:01:21,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 331 transitions, 730 flow [2024-11-09 07:01:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-09 07:01:21,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764484574868322 [2024-11-09 07:01:21,905 INFO L175 Difference]: Start difference. First operand has 329 places, 332 transitions, 676 flow. Second operand 3 states and 1016 transitions. [2024-11-09 07:01:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 331 transitions, 730 flow [2024-11-09 07:01:21,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 331 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:21,911 INFO L231 Difference]: Finished difference. Result has 328 places, 331 transitions, 674 flow [2024-11-09 07:01:21,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=328, PETRI_TRANSITIONS=331} [2024-11-09 07:01:21,911 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -85 predicate places. [2024-11-09 07:01:21,912 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 331 transitions, 674 flow [2024-11-09 07:01:21,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:21,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:21,913 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] [2024-11-09 07:01:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:01:21,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:21,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash -931641241, now seen corresponding path program 1 times [2024-11-09 07:01:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112342219] [2024-11-09 07:01:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112342219] [2024-11-09 07:01:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112342219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:21,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:21,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253658343] [2024-11-09 07:01:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:21,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:21,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:21,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 443 [2024-11-09 07:01:21,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 331 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:21,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:21,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 443 [2024-11-09 07:01:21,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:22,316 INFO L124 PetriNetUnfolderBase]: 748/1707 cut-off events. [2024-11-09 07:01:22,317 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:22,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 1707 events. 748/1707 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8760 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2734. Up to 1008 conditions per place. [2024-11-09 07:01:22,324 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2024-11-09 07:01:22,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 330 transitions, 728 flow [2024-11-09 07:01:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-09 07:01:22,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764484574868322 [2024-11-09 07:01:22,326 INFO L175 Difference]: Start difference. First operand has 328 places, 331 transitions, 674 flow. Second operand 3 states and 1016 transitions. [2024-11-09 07:01:22,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 330 transitions, 728 flow [2024-11-09 07:01:22,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 330 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:22,330 INFO L231 Difference]: Finished difference. Result has 327 places, 330 transitions, 672 flow [2024-11-09 07:01:22,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=672, PETRI_PLACES=327, PETRI_TRANSITIONS=330} [2024-11-09 07:01:22,332 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -86 predicate places. [2024-11-09 07:01:22,332 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 330 transitions, 672 flow [2024-11-09 07:01:22,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:22,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:22,333 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] [2024-11-09 07:01:22,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:01:22,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash -631685377, now seen corresponding path program 1 times [2024-11-09 07:01:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672138189] [2024-11-09 07:01:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672138189] [2024-11-09 07:01:22,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672138189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:22,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:22,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191918954] [2024-11-09 07:01:22,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:22,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:22,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:22,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:22,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:22,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 443 [2024-11-09 07:01:22,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 330 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:22,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:22,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 443 [2024-11-09 07:01:22,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:22,810 INFO L124 PetriNetUnfolderBase]: 748/1706 cut-off events. [2024-11-09 07:01:22,810 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:22,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 1706 events. 748/1706 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8792 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2725. Up to 1008 conditions per place. [2024-11-09 07:01:22,817 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2024-11-09 07:01:22,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 329 transitions, 726 flow [2024-11-09 07:01:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-09 07:01:22,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764484574868322 [2024-11-09 07:01:22,823 INFO L175 Difference]: Start difference. First operand has 327 places, 330 transitions, 672 flow. Second operand 3 states and 1016 transitions. [2024-11-09 07:01:22,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 329 transitions, 726 flow [2024-11-09 07:01:22,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 329 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:22,827 INFO L231 Difference]: Finished difference. Result has 326 places, 329 transitions, 670 flow [2024-11-09 07:01:22,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=326, PETRI_TRANSITIONS=329} [2024-11-09 07:01:22,830 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -87 predicate places. [2024-11-09 07:01:22,830 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 329 transitions, 670 flow [2024-11-09 07:01:22,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:22,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:22,831 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] [2024-11-09 07:01:22,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:01:22,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash 219737943, now seen corresponding path program 1 times [2024-11-09 07:01:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:22,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918565252] [2024-11-09 07:01:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918565252] [2024-11-09 07:01:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918565252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838258016] [2024-11-09 07:01:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:22,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:22,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:22,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 443 [2024-11-09 07:01:22,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 329 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:22,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:22,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 443 [2024-11-09 07:01:22,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:23,117 INFO L124 PetriNetUnfolderBase]: 748/1705 cut-off events. [2024-11-09 07:01:23,117 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:23,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 1705 events. 748/1705 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8788 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2716. Up to 1008 conditions per place. [2024-11-09 07:01:23,136 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2024-11-09 07:01:23,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 328 transitions, 724 flow [2024-11-09 07:01:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-09 07:01:23,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764484574868322 [2024-11-09 07:01:23,141 INFO L175 Difference]: Start difference. First operand has 326 places, 329 transitions, 670 flow. Second operand 3 states and 1016 transitions. [2024-11-09 07:01:23,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 328 transitions, 724 flow [2024-11-09 07:01:23,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 328 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:23,150 INFO L231 Difference]: Finished difference. Result has 325 places, 328 transitions, 668 flow [2024-11-09 07:01:23,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=325, PETRI_TRANSITIONS=328} [2024-11-09 07:01:23,151 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -88 predicate places. [2024-11-09 07:01:23,156 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 328 transitions, 668 flow [2024-11-09 07:01:23,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:23,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:23,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:23,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:01:23,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:23,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash 768603957, now seen corresponding path program 1 times [2024-11-09 07:01:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:23,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168967843] [2024-11-09 07:01:23,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168967843] [2024-11-09 07:01:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168967843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:23,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7451817] [2024-11-09 07:01:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:23,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:23,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:23,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 443 [2024-11-09 07:01:23,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 328 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:23,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:23,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 443 [2024-11-09 07:01:23,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:23,519 INFO L124 PetriNetUnfolderBase]: 748/1704 cut-off events. [2024-11-09 07:01:23,519 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:23,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1704 events. 748/1704 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8846 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2707. Up to 1008 conditions per place. [2024-11-09 07:01:23,529 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2024-11-09 07:01:23,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 327 transitions, 722 flow [2024-11-09 07:01:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-09 07:01:23,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764484574868322 [2024-11-09 07:01:23,531 INFO L175 Difference]: Start difference. First operand has 325 places, 328 transitions, 668 flow. Second operand 3 states and 1016 transitions. [2024-11-09 07:01:23,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 327 transitions, 722 flow [2024-11-09 07:01:23,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 327 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:23,535 INFO L231 Difference]: Finished difference. Result has 324 places, 327 transitions, 666 flow [2024-11-09 07:01:23,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=324, PETRI_TRANSITIONS=327} [2024-11-09 07:01:23,536 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -89 predicate places. [2024-11-09 07:01:23,536 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 327 transitions, 666 flow [2024-11-09 07:01:23,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:23,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:23,537 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] [2024-11-09 07:01:23,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:01:23,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:23,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1550398428, now seen corresponding path program 1 times [2024-11-09 07:01:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:23,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145920142] [2024-11-09 07:01:23,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145920142] [2024-11-09 07:01:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145920142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:23,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145260067] [2024-11-09 07:01:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:23,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:23,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 443 [2024-11-09 07:01:23,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 327 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:23,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:23,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 443 [2024-11-09 07:01:23,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:23,860 INFO L124 PetriNetUnfolderBase]: 748/1703 cut-off events. [2024-11-09 07:01:23,860 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2786 conditions, 1703 events. 748/1703 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8798 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2698. Up to 1008 conditions per place. [2024-11-09 07:01:23,868 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2024-11-09 07:01:23,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 326 transitions, 720 flow [2024-11-09 07:01:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-09 07:01:23,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764484574868322 [2024-11-09 07:01:23,871 INFO L175 Difference]: Start difference. First operand has 324 places, 327 transitions, 666 flow. Second operand 3 states and 1016 transitions. [2024-11-09 07:01:23,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 326 transitions, 720 flow [2024-11-09 07:01:23,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 326 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:23,875 INFO L231 Difference]: Finished difference. Result has 323 places, 326 transitions, 664 flow [2024-11-09 07:01:23,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=323, PETRI_TRANSITIONS=326} [2024-11-09 07:01:23,876 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -90 predicate places. [2024-11-09 07:01:23,876 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 326 transitions, 664 flow [2024-11-09 07:01:23,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:23,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:23,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:01:23,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1904353867, now seen corresponding path program 1 times [2024-11-09 07:01:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48013207] [2024-11-09 07:01:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:23,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48013207] [2024-11-09 07:01:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48013207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:23,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510820655] [2024-11-09 07:01:23,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:23,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:23,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:23,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 443 [2024-11-09 07:01:23,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 326 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:23,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:23,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 443 [2024-11-09 07:01:23,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:24,134 INFO L124 PetriNetUnfolderBase]: 748/1702 cut-off events. [2024-11-09 07:01:24,134 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:24,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1702 events. 748/1702 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8787 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2689. Up to 1008 conditions per place. [2024-11-09 07:01:24,142 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2024-11-09 07:01:24,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 325 transitions, 718 flow [2024-11-09 07:01:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-09 07:01:24,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764484574868322 [2024-11-09 07:01:24,168 INFO L175 Difference]: Start difference. First operand has 323 places, 326 transitions, 664 flow. Second operand 3 states and 1016 transitions. [2024-11-09 07:01:24,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 325 transitions, 718 flow [2024-11-09 07:01:24,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 325 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:24,171 INFO L231 Difference]: Finished difference. Result has 322 places, 325 transitions, 662 flow [2024-11-09 07:01:24,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=322, PETRI_TRANSITIONS=325} [2024-11-09 07:01:24,172 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -91 predicate places. [2024-11-09 07:01:24,172 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 325 transitions, 662 flow [2024-11-09 07:01:24,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:24,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:24,173 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] [2024-11-09 07:01:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:01:24,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:24,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash -949216888, now seen corresponding path program 1 times [2024-11-09 07:01:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073922206] [2024-11-09 07:01:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073922206] [2024-11-09 07:01:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073922206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530940035] [2024-11-09 07:01:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:24,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:24,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 443 [2024-11-09 07:01:24,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 325 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:24,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:24,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 443 [2024-11-09 07:01:24,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:24,425 INFO L124 PetriNetUnfolderBase]: 748/1701 cut-off events. [2024-11-09 07:01:24,425 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:24,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1701 events. 748/1701 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8834 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2677. Up to 1005 conditions per place. [2024-11-09 07:01:24,433 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 24 selfloop transitions, 1 changer transitions 0/324 dead transitions. [2024-11-09 07:01:24,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 324 transitions, 710 flow [2024-11-09 07:01:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2024-11-09 07:01:24,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7712565838976674 [2024-11-09 07:01:24,435 INFO L175 Difference]: Start difference. First operand has 322 places, 325 transitions, 662 flow. Second operand 3 states and 1025 transitions. [2024-11-09 07:01:24,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 324 transitions, 710 flow [2024-11-09 07:01:24,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 324 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:24,438 INFO L231 Difference]: Finished difference. Result has 321 places, 324 transitions, 658 flow [2024-11-09 07:01:24,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=321, PETRI_TRANSITIONS=324} [2024-11-09 07:01:24,439 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -92 predicate places. [2024-11-09 07:01:24,439 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 324 transitions, 658 flow [2024-11-09 07:01:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:24,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:24,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:24,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:01:24,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash -544206224, now seen corresponding path program 1 times [2024-11-09 07:01:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731425448] [2024-11-09 07:01:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731425448] [2024-11-09 07:01:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731425448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:24,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:24,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051668524] [2024-11-09 07:01:24,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:24,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:24,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:24,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 443 [2024-11-09 07:01:24,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 324 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:24,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:24,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 443 [2024-11-09 07:01:24,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:24,703 INFO L124 PetriNetUnfolderBase]: 748/1700 cut-off events. [2024-11-09 07:01:24,704 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:24,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1700 events. 748/1700 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8815 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2677. Up to 1007 conditions per place. [2024-11-09 07:01:24,710 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 25 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-11-09 07:01:24,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 323 transitions, 710 flow [2024-11-09 07:01:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2024-11-09 07:01:24,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659894657637322 [2024-11-09 07:01:24,712 INFO L175 Difference]: Start difference. First operand has 321 places, 324 transitions, 658 flow. Second operand 3 states and 1018 transitions. [2024-11-09 07:01:24,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 323 transitions, 710 flow [2024-11-09 07:01:24,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 323 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:24,716 INFO L231 Difference]: Finished difference. Result has 321 places, 323 transitions, 659 flow [2024-11-09 07:01:24,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=321, PETRI_TRANSITIONS=323} [2024-11-09 07:01:24,716 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -92 predicate places. [2024-11-09 07:01:24,717 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 323 transitions, 659 flow [2024-11-09 07:01:24,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:24,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:24,717 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:01:24,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1298893284, now seen corresponding path program 1 times [2024-11-09 07:01:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977915580] [2024-11-09 07:01:24,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:25,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977915580] [2024-11-09 07:01:25,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977915580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:25,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:25,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:01:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173816182] [2024-11-09 07:01:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:25,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:01:25,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:25,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:01:25,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:01:25,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 443 [2024-11-09 07:01:25,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 323 transitions, 659 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:25,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:25,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 443 [2024-11-09 07:01:25,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:25,405 INFO L124 PetriNetUnfolderBase]: 748/1698 cut-off events. [2024-11-09 07:01:25,405 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:25,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 1698 events. 748/1698 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8774 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2699. Up to 1020 conditions per place. [2024-11-09 07:01:25,417 INFO L140 encePairwiseOnDemand]: 431/443 looper letters, 38 selfloop transitions, 10 changer transitions 0/321 dead transitions. [2024-11-09 07:01:25,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 321 transitions, 751 flow [2024-11-09 07:01:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:01:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:01:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1904 transitions. [2024-11-09 07:01:25,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7163280662151994 [2024-11-09 07:01:25,421 INFO L175 Difference]: Start difference. First operand has 321 places, 323 transitions, 659 flow. Second operand 6 states and 1904 transitions. [2024-11-09 07:01:25,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 321 transitions, 751 flow [2024-11-09 07:01:25,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 321 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:25,425 INFO L231 Difference]: Finished difference. Result has 322 places, 321 transitions, 671 flow [2024-11-09 07:01:25,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=671, PETRI_PLACES=322, PETRI_TRANSITIONS=321} [2024-11-09 07:01:25,427 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -91 predicate places. [2024-11-09 07:01:25,428 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 321 transitions, 671 flow [2024-11-09 07:01:25,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:25,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:25,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:25,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:01:25,429 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:25,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1625719868, now seen corresponding path program 1 times [2024-11-09 07:01:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287319693] [2024-11-09 07:01:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:25,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287319693] [2024-11-09 07:01:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287319693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:25,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29447450] [2024-11-09 07:01:25,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:25,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:25,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 443 [2024-11-09 07:01:25,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 321 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:25,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:25,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 443 [2024-11-09 07:01:25,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:25,694 INFO L124 PetriNetUnfolderBase]: 748/1697 cut-off events. [2024-11-09 07:01:25,694 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:25,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2786 conditions, 1697 events. 748/1697 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8843 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2753. Up to 1005 conditions per place. [2024-11-09 07:01:25,703 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 24 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2024-11-09 07:01:25,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 320 transitions, 719 flow [2024-11-09 07:01:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2024-11-09 07:01:25,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7712565838976674 [2024-11-09 07:01:25,706 INFO L175 Difference]: Start difference. First operand has 322 places, 321 transitions, 671 flow. Second operand 3 states and 1025 transitions. [2024-11-09 07:01:25,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 320 transitions, 719 flow [2024-11-09 07:01:25,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 320 transitions, 699 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:01:25,710 INFO L231 Difference]: Finished difference. Result has 318 places, 320 transitions, 651 flow [2024-11-09 07:01:25,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=318, PETRI_TRANSITIONS=320} [2024-11-09 07:01:25,711 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -95 predicate places. [2024-11-09 07:01:25,711 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 320 transitions, 651 flow [2024-11-09 07:01:25,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:25,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:25,712 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] [2024-11-09 07:01:25,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:01:25,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:25,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 788888152, now seen corresponding path program 1 times [2024-11-09 07:01:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:25,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471476360] [2024-11-09 07:01:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:25,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471476360] [2024-11-09 07:01:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471476360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542377590] [2024-11-09 07:01:25,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:25,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:25,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:25,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:25,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 443 [2024-11-09 07:01:25,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 320 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:25,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:25,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 443 [2024-11-09 07:01:25,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:26,052 INFO L124 PetriNetUnfolderBase]: 748/1696 cut-off events. [2024-11-09 07:01:26,052 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:26,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 1696 events. 748/1696 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8794 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2674. Up to 1007 conditions per place. [2024-11-09 07:01:26,062 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 25 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2024-11-09 07:01:26,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 703 flow [2024-11-09 07:01:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2024-11-09 07:01:26,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659894657637322 [2024-11-09 07:01:26,065 INFO L175 Difference]: Start difference. First operand has 318 places, 320 transitions, 651 flow. Second operand 3 states and 1018 transitions. [2024-11-09 07:01:26,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 703 flow [2024-11-09 07:01:26,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:26,069 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 652 flow [2024-11-09 07:01:26,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2024-11-09 07:01:26,070 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -95 predicate places. [2024-11-09 07:01:26,070 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 652 flow [2024-11-09 07:01:26,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:26,071 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] [2024-11-09 07:01:26,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:01:26,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:26,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash -467831567, now seen corresponding path program 1 times [2024-11-09 07:01:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835194828] [2024-11-09 07:01:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835194828] [2024-11-09 07:01:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835194828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602399500] [2024-11-09 07:01:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:26,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 443 [2024-11-09 07:01:26,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:26,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 443 [2024-11-09 07:01:26,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:26,347 INFO L124 PetriNetUnfolderBase]: 748/1694 cut-off events. [2024-11-09 07:01:26,347 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:26,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 1694 events. 748/1694 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8776 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2674. Up to 1007 conditions per place. [2024-11-09 07:01:26,353 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 1 changer transitions 0/317 dead transitions. [2024-11-09 07:01:26,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 317 transitions, 702 flow [2024-11-09 07:01:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2024-11-09 07:01:26,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7667419112114372 [2024-11-09 07:01:26,355 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 652 flow. Second operand 3 states and 1019 transitions. [2024-11-09 07:01:26,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 317 transitions, 702 flow [2024-11-09 07:01:26,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 317 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:26,359 INFO L231 Difference]: Finished difference. Result has 316 places, 317 transitions, 646 flow [2024-11-09 07:01:26,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=316, PETRI_TRANSITIONS=317} [2024-11-09 07:01:26,360 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -97 predicate places. [2024-11-09 07:01:26,360 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 317 transitions, 646 flow [2024-11-09 07:01:26,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:26,361 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] [2024-11-09 07:01:26,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:01:26,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:26,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash -512296548, now seen corresponding path program 1 times [2024-11-09 07:01:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555057747] [2024-11-09 07:01:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555057747] [2024-11-09 07:01:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555057747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:26,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:26,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376151053] [2024-11-09 07:01:26,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:26,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:26,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:26,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:26,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 443 [2024-11-09 07:01:26,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 317 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:26,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 443 [2024-11-09 07:01:26,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:26,590 INFO L124 PetriNetUnfolderBase]: 748/1693 cut-off events. [2024-11-09 07:01:26,591 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:26,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 1693 events. 748/1693 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8768 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2670. Up to 1005 conditions per place. [2024-11-09 07:01:26,598 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 24 selfloop transitions, 1 changer transitions 0/316 dead transitions. [2024-11-09 07:01:26,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 316 transitions, 694 flow [2024-11-09 07:01:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2024-11-09 07:01:26,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7712565838976674 [2024-11-09 07:01:26,601 INFO L175 Difference]: Start difference. First operand has 316 places, 317 transitions, 646 flow. Second operand 3 states and 1025 transitions. [2024-11-09 07:01:26,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 316 transitions, 694 flow [2024-11-09 07:01:26,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 316 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:26,604 INFO L231 Difference]: Finished difference. Result has 316 places, 316 transitions, 645 flow [2024-11-09 07:01:26,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=316, PETRI_TRANSITIONS=316} [2024-11-09 07:01:26,605 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -97 predicate places. [2024-11-09 07:01:26,605 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 316 transitions, 645 flow [2024-11-09 07:01:26,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:26,606 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:26,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:01:26,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:26,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1604322697, now seen corresponding path program 1 times [2024-11-09 07:01:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124254962] [2024-11-09 07:01:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:26,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124254962] [2024-11-09 07:01:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124254962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:26,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:26,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962758707] [2024-11-09 07:01:26,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:26,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:26,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 443 [2024-11-09 07:01:26,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 316 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:26,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 443 [2024-11-09 07:01:26,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:26,900 INFO L124 PetriNetUnfolderBase]: 748/1691 cut-off events. [2024-11-09 07:01:26,901 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:01:26,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1691 events. 748/1691 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8780 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2671. Up to 1007 conditions per place. [2024-11-09 07:01:26,906 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 26 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2024-11-09 07:01:26,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 695 flow [2024-11-09 07:01:26,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2024-11-09 07:01:26,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7667419112114372 [2024-11-09 07:01:26,908 INFO L175 Difference]: Start difference. First operand has 316 places, 316 transitions, 645 flow. Second operand 3 states and 1019 transitions. [2024-11-09 07:01:26,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 695 flow [2024-11-09 07:01:26,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 314 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:26,911 INFO L231 Difference]: Finished difference. Result has 315 places, 314 transitions, 642 flow [2024-11-09 07:01:26,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=315, PETRI_TRANSITIONS=314} [2024-11-09 07:01:26,912 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -98 predicate places. [2024-11-09 07:01:26,912 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 314 transitions, 642 flow [2024-11-09 07:01:26,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:26,913 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] [2024-11-09 07:01:26,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:01:26,913 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:26,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -118060070, now seen corresponding path program 1 times [2024-11-09 07:01:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133768629] [2024-11-09 07:01:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133768629] [2024-11-09 07:01:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133768629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624404167] [2024-11-09 07:01:26,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:26,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:26,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 443 [2024-11-09 07:01:26,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 314 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:26,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:26,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 443 [2024-11-09 07:01:26,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:27,281 INFO L124 PetriNetUnfolderBase]: 1256/2818 cut-off events. [2024-11-09 07:01:27,281 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-09 07:01:27,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4644 conditions, 2818 events. 1256/2818 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17593 event pairs, 792 based on Foata normal form. 0/2548 useless extension candidates. Maximal degree in co-relation 4540. Up to 1084 conditions per place. [2024-11-09 07:01:27,296 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 44 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2024-11-09 07:01:27,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 334 transitions, 782 flow [2024-11-09 07:01:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2024-11-09 07:01:27,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7870579382994732 [2024-11-09 07:01:27,299 INFO L175 Difference]: Start difference. First operand has 315 places, 314 transitions, 642 flow. Second operand 3 states and 1046 transitions. [2024-11-09 07:01:27,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 334 transitions, 782 flow [2024-11-09 07:01:27,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 334 transitions, 781 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:27,305 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 649 flow [2024-11-09 07:01:27,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2024-11-09 07:01:27,306 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -97 predicate places. [2024-11-09 07:01:27,306 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 649 flow [2024-11-09 07:01:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:27,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:27,306 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] [2024-11-09 07:01:27,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:01:27,307 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:27,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1786513873, now seen corresponding path program 1 times [2024-11-09 07:01:27,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:27,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720020191] [2024-11-09 07:01:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720020191] [2024-11-09 07:01:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720020191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059037137] [2024-11-09 07:01:27,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:27,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 443 [2024-11-09 07:01:27,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:27,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:27,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 443 [2024-11-09 07:01:27,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:27,905 INFO L124 PetriNetUnfolderBase]: 1871/4216 cut-off events. [2024-11-09 07:01:27,905 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2024-11-09 07:01:27,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7295 conditions, 4216 events. 1871/4216 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 30205 event pairs, 796 based on Foata normal form. 0/3781 useless extension candidates. Maximal degree in co-relation 7190. Up to 1415 conditions per place. [2024-11-09 07:01:27,928 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 45 selfloop transitions, 4 changer transitions 0/336 dead transitions. [2024-11-09 07:01:27,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 336 transitions, 804 flow [2024-11-09 07:01:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2024-11-09 07:01:27,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7878103837471784 [2024-11-09 07:01:27,930 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 649 flow. Second operand 3 states and 1047 transitions. [2024-11-09 07:01:27,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 336 transitions, 804 flow [2024-11-09 07:01:27,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 336 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:27,934 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 677 flow [2024-11-09 07:01:27,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2024-11-09 07:01:27,935 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -95 predicate places. [2024-11-09 07:01:27,935 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 677 flow [2024-11-09 07:01:27,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:27,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:27,936 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] [2024-11-09 07:01:27,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:01:27,936 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1783249566, now seen corresponding path program 1 times [2024-11-09 07:01:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774716424] [2024-11-09 07:01:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:27,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:27,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774716424] [2024-11-09 07:01:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774716424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:27,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206266715] [2024-11-09 07:01:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:27,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:27,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:27,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 443 [2024-11-09 07:01:27,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:27,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:27,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 443 [2024-11-09 07:01:27,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:29,378 INFO L124 PetriNetUnfolderBase]: 3256/7145 cut-off events. [2024-11-09 07:01:29,379 INFO L125 PetriNetUnfolderBase]: For 2821/2821 co-relation queries the response was YES. [2024-11-09 07:01:29,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13474 conditions, 7145 events. 3256/7145 cut-off events. For 2821/2821 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 58285 event pairs, 1976 based on Foata normal form. 0/6428 useless extension candidates. Maximal degree in co-relation 13368. Up to 2692 conditions per place. [2024-11-09 07:01:29,407 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 52 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2024-11-09 07:01:29,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 340 transitions, 867 flow [2024-11-09 07:01:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2024-11-09 07:01:29,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7870579382994732 [2024-11-09 07:01:29,410 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 677 flow. Second operand 3 states and 1046 transitions. [2024-11-09 07:01:29,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 340 transitions, 867 flow [2024-11-09 07:01:29,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 340 transitions, 853 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:29,416 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 677 flow [2024-11-09 07:01:29,416 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2024-11-09 07:01:29,417 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -95 predicate places. [2024-11-09 07:01:29,417 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 677 flow [2024-11-09 07:01:29,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:29,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:29,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:29,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:01:29,418 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:29,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash -10817860, now seen corresponding path program 1 times [2024-11-09 07:01:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:29,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494451917] [2024-11-09 07:01:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:29,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494451917] [2024-11-09 07:01:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494451917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:29,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990666495] [2024-11-09 07:01:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:29,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:29,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 443 [2024-11-09 07:01:29,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:29,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:29,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 443 [2024-11-09 07:01:29,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:30,817 INFO L124 PetriNetUnfolderBase]: 4475/9772 cut-off events. [2024-11-09 07:01:30,818 INFO L125 PetriNetUnfolderBase]: For 3203/3203 co-relation queries the response was YES. [2024-11-09 07:01:30,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18651 conditions, 9772 events. 4475/9772 cut-off events. For 3203/3203 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 84215 event pairs, 1933 based on Foata normal form. 0/8778 useless extension candidates. Maximal degree in co-relation 18544. Up to 3688 conditions per place. [2024-11-09 07:01:30,891 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 53 selfloop transitions, 4 changer transitions 0/342 dead transitions. [2024-11-09 07:01:30,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 342 transitions, 876 flow [2024-11-09 07:01:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2024-11-09 07:01:30,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7878103837471784 [2024-11-09 07:01:30,894 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 677 flow. Second operand 3 states and 1047 transitions. [2024-11-09 07:01:30,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 342 transitions, 876 flow [2024-11-09 07:01:30,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 342 transitions, 873 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:30,900 INFO L231 Difference]: Finished difference. Result has 320 places, 318 transitions, 705 flow [2024-11-09 07:01:30,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=320, PETRI_TRANSITIONS=318} [2024-11-09 07:01:30,902 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -93 predicate places. [2024-11-09 07:01:30,902 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 318 transitions, 705 flow [2024-11-09 07:01:30,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:30,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:30,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:01:30,903 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-09 07:01:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -990069319, now seen corresponding path program 1 times [2024-11-09 07:01:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277574389] [2024-11-09 07:01:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:31,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277574389] [2024-11-09 07:01:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277574389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:31,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:31,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327137100] [2024-11-09 07:01:31,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:31,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:31,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 443 [2024-11-09 07:01:31,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 318 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:31,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:31,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 443 [2024-11-09 07:01:31,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:32,655 INFO L124 PetriNetUnfolderBase]: 4475/10010 cut-off events. [2024-11-09 07:01:32,659 INFO L125 PetriNetUnfolderBase]: For 5912/5912 co-relation queries the response was YES. [2024-11-09 07:01:32,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20173 conditions, 10010 events. 4475/10010 cut-off events. For 5912/5912 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 88830 event pairs, 2649 based on Foata normal form. 16/8986 useless extension candidates. Maximal degree in co-relation 20066. Up to 6067 conditions per place. [2024-11-09 07:01:32,767 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 0 selfloop transitions, 0 changer transitions 317/317 dead transitions. [2024-11-09 07:01:32,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 317 transitions, 765 flow [2024-11-09 07:01:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2024-11-09 07:01:32,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7720090293453724 [2024-11-09 07:01:32,773 INFO L175 Difference]: Start difference. First operand has 320 places, 318 transitions, 705 flow. Second operand 3 states and 1026 transitions. [2024-11-09 07:01:32,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 317 transitions, 765 flow [2024-11-09 07:01:32,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 317 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:32,790 INFO L231 Difference]: Finished difference. Result has 319 places, 0 transitions, 0 flow [2024-11-09 07:01:32,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=319, PETRI_TRANSITIONS=0} [2024-11-09 07:01:32,791 INFO L277 CegarLoopForPetriNet]: 413 programPoint places, -94 predicate places. [2024-11-09 07:01:32,791 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 0 transitions, 0 flow [2024-11-09 07:01:32,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:32,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (168 of 169 remaining) [2024-11-09 07:01:32,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (167 of 169 remaining) [2024-11-09 07:01:32,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (166 of 169 remaining) [2024-11-09 07:01:32,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (165 of 169 remaining) [2024-11-09 07:01:32,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 169 remaining) [2024-11-09 07:01:32,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (163 of 169 remaining) [2024-11-09 07:01:32,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (162 of 169 remaining) [2024-11-09 07:01:32,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (161 of 169 remaining) [2024-11-09 07:01:32,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (160 of 169 remaining) [2024-11-09 07:01:32,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (159 of 169 remaining) [2024-11-09 07:01:32,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 169 remaining) [2024-11-09 07:01:32,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (157 of 169 remaining) [2024-11-09 07:01:32,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (156 of 169 remaining) [2024-11-09 07:01:32,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (155 of 169 remaining) [2024-11-09 07:01:32,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (153 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (152 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (151 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (150 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (149 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (148 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (147 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (146 of 169 remaining) [2024-11-09 07:01:32,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (145 of 169 remaining) [2024-11-09 07:01:32,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (144 of 169 remaining) [2024-11-09 07:01:32,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 169 remaining) [2024-11-09 07:01:32,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (142 of 169 remaining) [2024-11-09 07:01:32,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (141 of 169 remaining) [2024-11-09 07:01:32,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (140 of 169 remaining) [2024-11-09 07:01:32,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (139 of 169 remaining) [2024-11-09 07:01:32,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (138 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (137 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (135 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (134 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (133 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (132 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (131 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (130 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (129 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 169 remaining) [2024-11-09 07:01:32,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (126 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (125 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (124 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (123 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (122 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (121 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (120 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (119 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 169 remaining) [2024-11-09 07:01:32,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 169 remaining) [2024-11-09 07:01:32,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 169 remaining) [2024-11-09 07:01:32,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 169 remaining) [2024-11-09 07:01:32,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (112 of 169 remaining) [2024-11-09 07:01:32,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (111 of 169 remaining) [2024-11-09 07:01:32,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 169 remaining) [2024-11-09 07:01:32,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (108 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (107 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (105 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (104 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 169 remaining) [2024-11-09 07:01:32,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (98 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (97 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 169 remaining) [2024-11-09 07:01:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 169 remaining) [2024-11-09 07:01:32,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 169 remaining) [2024-11-09 07:01:32,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 169 remaining) [2024-11-09 07:01:32,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 169 remaining) [2024-11-09 07:01:32,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 169 remaining) [2024-11-09 07:01:32,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 169 remaining) [2024-11-09 07:01:32,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 169 remaining) [2024-11-09 07:01:32,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 169 remaining) [2024-11-09 07:01:32,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 169 remaining) [2024-11-09 07:01:32,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 169 remaining) [2024-11-09 07:01:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 169 remaining) [2024-11-09 07:01:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 169 remaining) [2024-11-09 07:01:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 169 remaining) [2024-11-09 07:01:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 169 remaining) [2024-11-09 07:01:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 169 remaining) [2024-11-09 07:01:32,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 169 remaining) [2024-11-09 07:01:32,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 169 remaining) [2024-11-09 07:01:32,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 169 remaining) [2024-11-09 07:01:32,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 169 remaining) [2024-11-09 07:01:32,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 169 remaining) [2024-11-09 07:01:32,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 169 remaining) [2024-11-09 07:01:32,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 169 remaining) [2024-11-09 07:01:32,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 169 remaining) [2024-11-09 07:01:32,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 169 remaining) [2024-11-09 07:01:32,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 169 remaining) [2024-11-09 07:01:32,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 169 remaining) [2024-11-09 07:01:32,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 169 remaining) [2024-11-09 07:01:32,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 169 remaining) [2024-11-09 07:01:32,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 169 remaining) [2024-11-09 07:01:32,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 169 remaining) [2024-11-09 07:01:32,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 169 remaining) [2024-11-09 07:01:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 169 remaining) [2024-11-09 07:01:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 169 remaining) [2024-11-09 07:01:32,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:01:32,840 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] [2024-11-09 07:01:32,857 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:01:32,857 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:01:32,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:01:32 BasicIcfg [2024-11-09 07:01:32,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:01:32,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:01:32,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:01:32,873 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:01:32,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:19" (3/4) ... [2024-11-09 07:01:32,876 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:01:32,882 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:01:32,883 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:01:32,883 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 07:01:32,883 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-09 07:01:32,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-09 07:01:32,900 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:01:32,900 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 07:01:32,901 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:01:33,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:01:33,082 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:01:33,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:01:33,083 INFO L158 Benchmark]: Toolchain (without parser) took 15482.93ms. Allocated memory was 169.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 101.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 266.1MB. Max. memory is 16.1GB. [2024-11-09 07:01:33,083 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:01:33,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.65ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 132.0MB in the end (delta: -31.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:01:33,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.06ms. Allocated memory is still 169.9MB. Free memory was 132.0MB in the beginning and 128.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:33,084 INFO L158 Benchmark]: Boogie Preprocessor took 76.56ms. Allocated memory is still 169.9MB. Free memory was 128.4MB in the beginning and 124.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:33,084 INFO L158 Benchmark]: RCFGBuilder took 1381.95ms. Allocated memory is still 169.9MB. Free memory was 124.7MB in the beginning and 85.1MB in the end (delta: 39.6MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-11-09 07:01:33,084 INFO L158 Benchmark]: TraceAbstraction took 13395.31ms. Allocated memory was 169.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 85.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-09 07:01:33,085 INFO L158 Benchmark]: Witness Printer took 209.74ms. Allocated memory is still 2.9GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 07:01:33,086 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.63ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.65ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 132.0MB in the end (delta: -31.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.06ms. Allocated memory is still 169.9MB. Free memory was 132.0MB in the beginning and 128.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.56ms. Allocated memory is still 169.9MB. Free memory was 128.4MB in the beginning and 124.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1381.95ms. Allocated memory is still 169.9MB. Free memory was 124.7MB in the beginning and 85.1MB in the end (delta: 39.6MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13395.31ms. Allocated memory was 169.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 85.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 209.74ms. Allocated memory is still 2.9GB. Free memory was 2.6GB in the beginning and 2.6GB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: 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: 130]: 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: 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: 165]: 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: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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 9 procedures, 529 locations, 169 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: 13.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 498 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1338 IncrementalHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 90 mSDtfsCounter, 1338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 95 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:01:33,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE