./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring.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-ring.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:01:37,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:01:37,131 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:37,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:01:37,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:01:37,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:01:37,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:01:37,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:01:37,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:01:37,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:01:37,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:01:37,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:01:37,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:01:37,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:01:37,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:01:37,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:01:37,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:01:37,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:01:37,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:01:37,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:01:37,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:01:37,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:01:37,155 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:01:37,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:01:37,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:01:37,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:01:37,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:01:37,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:01:37,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:01:37,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:01:37,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:01:37,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:37,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:01:37,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:01:37,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:01:37,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:01:37,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:01:37,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:01:37,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:01:37,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:01:37,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:01:37,160 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2024-11-09 07:01:37,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:01:37,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:01:37,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:01:37,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:01:37,370 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:01:37,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2024-11-09 07:01:38,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:01:38,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:01:38,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2024-11-09 07:01:38,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfbf89b5/756fa0fd34194d1d87645d565e2aa288/FLAGcd0c3521c [2024-11-09 07:01:38,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfbf89b5/756fa0fd34194d1d87645d565e2aa288 [2024-11-09 07:01:38,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:01:38,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:01:38,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:39,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:01:39,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:01:39,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:38" (1/1) ... [2024-11-09 07:01:39,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7282d4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:39, skipping insertion in model container [2024-11-09 07:01:39,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:38" (1/1) ... [2024-11-09 07:01:39,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:01:39,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:39,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:01:39,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:39,358 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:01:39,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:39 WrapperNode [2024-11-09 07:01:39,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:39,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:39,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:01:39,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:01:39,366 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:39" (1/1) ... [2024-11-09 07:01:39,378 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:39" (1/1) ... [2024-11-09 07:01:39,457 INFO L138 Inliner]: procedures = 24, calls = 47, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 614 [2024-11-09 07:01:39,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:39,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:01:39,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:01:39,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:01:39,474 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:39" (1/1) ... [2024-11-09 07:01:39,474 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:39" (1/1) ... [2024-11-09 07:01:39,481 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:39" (1/1) ... [2024-11-09 07:01:39,484 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:39" (1/1) ... [2024-11-09 07:01:39,537 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:39" (1/1) ... [2024-11-09 07:01:39,546 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:39" (1/1) ... [2024-11-09 07:01:39,552 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:39" (1/1) ... [2024-11-09 07:01:39,558 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:39" (1/1) ... [2024-11-09 07:01:39,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:01:39,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:01:39,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:01:39,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:01:39,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:39" (1/1) ... [2024-11-09 07:01:39,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:01:39,594 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:39,597 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:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:01:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:01:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:01:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:01:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:01:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:01:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:01:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:01:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:01:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:01:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:01:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:01:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:01:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:01:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:01:39,634 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:39,746 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:01:39,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:01:40,357 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:01:40,358 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:01:40,872 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:01:40,872 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 07:01:40,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:40 BoogieIcfgContainer [2024-11-09 07:01:40,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:01:40,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:01:40,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:01:40,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:01:40,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:01:38" (1/3) ... [2024-11-09 07:01:40,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bb3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:40, skipping insertion in model container [2024-11-09 07:01:40,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:39" (2/3) ... [2024-11-09 07:01:40,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bb3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:40, skipping insertion in model container [2024-11-09 07:01:40,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:40" (3/3) ... [2024-11-09 07:01:40,880 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2024-11-09 07:01:40,894 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:01:40,894 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 90 error locations. [2024-11-09 07:01:40,895 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:01:40,996 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 07:01:41,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 460 transitions, 941 flow [2024-11-09 07:01:41,153 INFO L124 PetriNetUnfolderBase]: 22/457 cut-off events. [2024-11-09 07:01:41,153 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 07:01:41,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 457 events. 22/457 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 779 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 405. Up to 3 conditions per place. [2024-11-09 07:01:41,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 448 places, 460 transitions, 941 flow [2024-11-09 07:01:41,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 440 transitions, 898 flow [2024-11-09 07:01:41,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:01:41,176 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;@43c6c108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:01:41,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2024-11-09 07:01:41,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:01:41,180 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-11-09 07:01:41,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:01:41,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:41,181 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:41,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:41,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2057893164, now seen corresponding path program 1 times [2024-11-09 07:01:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:41,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165588215] [2024-11-09 07:01:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:41,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165588215] [2024-11-09 07:01:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165588215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:41,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449527152] [2024-11-09 07:01:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:41,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 460 [2024-11-09 07:01:41,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 440 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:41,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:41,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 460 [2024-11-09 07:01:41,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:41,572 INFO L124 PetriNetUnfolderBase]: 148/865 cut-off events. [2024-11-09 07:01:41,572 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-09 07:01:41,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 865 events. 148/865 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3659 event pairs, 92 based on Foata normal form. 75/843 useless extension candidates. Maximal degree in co-relation 754. Up to 219 conditions per place. [2024-11-09 07:01:41,580 INFO L140 encePairwiseOnDemand]: 380/460 looper letters, 18 selfloop transitions, 2 changer transitions 7/362 dead transitions. [2024-11-09 07:01:41,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 362 transitions, 782 flow [2024-11-09 07:01:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1175 transitions. [2024-11-09 07:01:41,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2024-11-09 07:01:41,596 INFO L175 Difference]: Start difference. First operand has 429 places, 440 transitions, 898 flow. Second operand 3 states and 1175 transitions. [2024-11-09 07:01:41,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 362 transitions, 782 flow [2024-11-09 07:01:41,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 362 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 07:01:41,606 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 720 flow [2024-11-09 07:01:41,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2024-11-09 07:01:41,612 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -67 predicate places. [2024-11-09 07:01:41,614 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 720 flow [2024-11-09 07:01:41,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:41,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:41,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:41,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:01:41,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash -807083259, now seen corresponding path program 1 times [2024-11-09 07:01:41,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460928961] [2024-11-09 07:01:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:41,681 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:41,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:41,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460928961] [2024-11-09 07:01:41,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460928961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:41,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:41,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:41,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251752052] [2024-11-09 07:01:41,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:41,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:41,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:41,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:41,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:41,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:41,892 INFO L124 PetriNetUnfolderBase]: 135/830 cut-off events. [2024-11-09 07:01:41,893 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:41,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 830 events. 135/830 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3514 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1009. Up to 195 conditions per place. [2024-11-09 07:01:41,898 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2024-11-09 07:01:41,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 354 transitions, 756 flow [2024-11-09 07:01:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-11-09 07:01:41,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-11-09 07:01:41,901 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 720 flow. Second operand 3 states and 1100 transitions. [2024-11-09 07:01:41,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 354 transitions, 756 flow [2024-11-09 07:01:41,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 354 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:41,910 INFO L231 Difference]: Finished difference. Result has 354 places, 354 transitions, 718 flow [2024-11-09 07:01:41,910 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=354, PETRI_TRANSITIONS=354} [2024-11-09 07:01:41,911 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -75 predicate places. [2024-11-09 07:01:41,911 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 354 transitions, 718 flow [2024-11-09 07:01:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:41,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:41,912 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:41,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:01:41,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:41,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1332953604, now seen corresponding path program 1 times [2024-11-09 07:01:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481096149] [2024-11-09 07:01:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:41,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:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481096149] [2024-11-09 07:01:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481096149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:41,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:41,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290112253] [2024-11-09 07:01:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:41,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:41,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:41,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:42,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:42,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 354 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:42,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:42,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:42,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:42,161 INFO L124 PetriNetUnfolderBase]: 135/829 cut-off events. [2024-11-09 07:01:42,162 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 829 events. 135/829 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3522 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1000. Up to 195 conditions per place. [2024-11-09 07:01:42,166 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2024-11-09 07:01:42,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 353 transitions, 754 flow [2024-11-09 07:01:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-11-09 07:01:42,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-11-09 07:01:42,169 INFO L175 Difference]: Start difference. First operand has 354 places, 354 transitions, 718 flow. Second operand 3 states and 1100 transitions. [2024-11-09 07:01:42,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 353 transitions, 754 flow [2024-11-09 07:01:42,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 353 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:42,173 INFO L231 Difference]: Finished difference. Result has 353 places, 353 transitions, 716 flow [2024-11-09 07:01:42,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=353, PETRI_TRANSITIONS=353} [2024-11-09 07:01:42,174 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -76 predicate places. [2024-11-09 07:01:42,174 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 353 transitions, 716 flow [2024-11-09 07:01:42,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:42,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:42,176 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:42,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:01:42,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -643084830, now seen corresponding path program 1 times [2024-11-09 07:01:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:42,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250537046] [2024-11-09 07:01:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:42,204 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:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250537046] [2024-11-09 07:01:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250537046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:42,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:42,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522647330] [2024-11-09 07:01:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:42,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:42,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 353 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:42,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:42,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:42,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:42,368 INFO L124 PetriNetUnfolderBase]: 135/828 cut-off events. [2024-11-09 07:01:42,369 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:42,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 828 events. 135/828 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3538 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 991. Up to 195 conditions per place. [2024-11-09 07:01:42,373 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2024-11-09 07:01:42,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 352 transitions, 752 flow [2024-11-09 07:01:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-11-09 07:01:42,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-11-09 07:01:42,375 INFO L175 Difference]: Start difference. First operand has 353 places, 353 transitions, 716 flow. Second operand 3 states and 1100 transitions. [2024-11-09 07:01:42,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 352 transitions, 752 flow [2024-11-09 07:01:42,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 352 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:42,379 INFO L231 Difference]: Finished difference. Result has 352 places, 352 transitions, 714 flow [2024-11-09 07:01:42,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=352, PETRI_TRANSITIONS=352} [2024-11-09 07:01:42,381 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2024-11-09 07:01:42,381 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 352 transitions, 714 flow [2024-11-09 07:01:42,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:42,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:42,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:42,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:01:42,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:42,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1496676515, now seen corresponding path program 1 times [2024-11-09 07:01:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:42,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126505947] [2024-11-09 07:01:42,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:42,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:42,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126505947] [2024-11-09 07:01:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126505947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:42,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504587541] [2024-11-09 07:01:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:42,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:42,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-11-09 07:01:42,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 352 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:42,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:42,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-11-09 07:01:42,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:42,549 INFO L124 PetriNetUnfolderBase]: 135/827 cut-off events. [2024-11-09 07:01:42,549 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:42,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 827 events. 135/827 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3533 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 979. Up to 192 conditions per place. [2024-11-09 07:01:42,553 INFO L140 encePairwiseOnDemand]: 458/460 looper letters, 15 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2024-11-09 07:01:42,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 744 flow [2024-11-09 07:01:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2024-11-09 07:01:42,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803623188405797 [2024-11-09 07:01:42,556 INFO L175 Difference]: Start difference. First operand has 352 places, 352 transitions, 714 flow. Second operand 3 states and 1109 transitions. [2024-11-09 07:01:42,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 744 flow [2024-11-09 07:01:42,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 351 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:42,561 INFO L231 Difference]: Finished difference. Result has 351 places, 351 transitions, 710 flow [2024-11-09 07:01:42,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=351, PETRI_TRANSITIONS=351} [2024-11-09 07:01:42,562 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -78 predicate places. [2024-11-09 07:01:42,563 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 351 transitions, 710 flow [2024-11-09 07:01:42,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:42,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:42,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:42,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:01:42,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash 372795618, now seen corresponding path program 1 times [2024-11-09 07:01:42,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:42,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162300768] [2024-11-09 07:01:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:43,057 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:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:43,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162300768] [2024-11-09 07:01:43,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162300768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:43,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:01:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663462148] [2024-11-09 07:01:43,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:43,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:01:43,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:01:43,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:01:43,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 460 [2024-11-09 07:01:43,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 351 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:43,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 460 [2024-11-09 07:01:43,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:43,439 INFO L124 PetriNetUnfolderBase]: 135/824 cut-off events. [2024-11-09 07:01:43,439 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:43,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 824 events. 135/824 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3538 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1012. Up to 215 conditions per place. [2024-11-09 07:01:43,444 INFO L140 encePairwiseOnDemand]: 442/460 looper letters, 37 selfloop transitions, 15 changer transitions 0/348 dead transitions. [2024-11-09 07:01:43,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 808 flow [2024-11-09 07:01:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:01:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:01:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2011 transitions. [2024-11-09 07:01:43,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7286231884057971 [2024-11-09 07:01:43,448 INFO L175 Difference]: Start difference. First operand has 351 places, 351 transitions, 710 flow. Second operand 6 states and 2011 transitions. [2024-11-09 07:01:43,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 348 transitions, 808 flow [2024-11-09 07:01:43,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 348 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:43,453 INFO L231 Difference]: Finished difference. Result has 352 places, 348 transitions, 733 flow [2024-11-09 07:01:43,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=352, PETRI_TRANSITIONS=348} [2024-11-09 07:01:43,455 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2024-11-09 07:01:43,455 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 348 transitions, 733 flow [2024-11-09 07:01:43,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:43,457 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:43,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:01:43,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:43,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1759250594, now seen corresponding path program 1 times [2024-11-09 07:01:43,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:43,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130647134] [2024-11-09 07:01:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:43,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:43,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130647134] [2024-11-09 07:01:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130647134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:43,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:43,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717039696] [2024-11-09 07:01:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:43,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-11-09 07:01:43,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 348 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:43,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-11-09 07:01:43,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:43,606 INFO L124 PetriNetUnfolderBase]: 135/823 cut-off events. [2024-11-09 07:01:43,607 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:43,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 823 events. 135/823 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3535 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1006. Up to 194 conditions per place. [2024-11-09 07:01:43,611 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 16 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2024-11-09 07:01:43,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 347 transitions, 767 flow [2024-11-09 07:01:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-11-09 07:01:43,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-11-09 07:01:43,614 INFO L175 Difference]: Start difference. First operand has 352 places, 348 transitions, 733 flow. Second operand 3 states and 1102 transitions. [2024-11-09 07:01:43,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 347 transitions, 767 flow [2024-11-09 07:01:43,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 347 transitions, 737 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:01:43,618 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 705 flow [2024-11-09 07:01:43,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2024-11-09 07:01:43,619 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -81 predicate places. [2024-11-09 07:01:43,619 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 705 flow [2024-11-09 07:01:43,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:43,620 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:43,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:01:43,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:43,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash 396484117, now seen corresponding path program 1 times [2024-11-09 07:01:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:43,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633175437] [2024-11-09 07:01:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:43,647 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:43,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633175437] [2024-11-09 07:01:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633175437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418638476] [2024-11-09 07:01:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:43,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:43,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-11-09 07:01:43,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:43,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-11-09 07:01:43,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:43,752 INFO L124 PetriNetUnfolderBase]: 135/822 cut-off events. [2024-11-09 07:01:43,752 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:43,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 822 events. 135/822 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3534 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 192 conditions per place. [2024-11-09 07:01:43,757 INFO L140 encePairwiseOnDemand]: 458/460 looper letters, 15 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2024-11-09 07:01:43,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 346 transitions, 735 flow [2024-11-09 07:01:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2024-11-09 07:01:43,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803623188405797 [2024-11-09 07:01:43,759 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 705 flow. Second operand 3 states and 1109 transitions. [2024-11-09 07:01:43,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 346 transitions, 735 flow [2024-11-09 07:01:43,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 346 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:43,763 INFO L231 Difference]: Finished difference. Result has 347 places, 346 transitions, 701 flow [2024-11-09 07:01:43,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=347, PETRI_TRANSITIONS=346} [2024-11-09 07:01:43,764 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2024-11-09 07:01:43,764 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 346 transitions, 701 flow [2024-11-09 07:01:43,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:43,765 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:43,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:01:43,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1682379237, now seen corresponding path program 1 times [2024-11-09 07:01:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966746332] [2024-11-09 07:01:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:43,803 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:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966746332] [2024-11-09 07:01:43,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966746332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:43,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:43,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892706703] [2024-11-09 07:01:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:43,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:43,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-11-09 07:01:43,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 346 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:43,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-11-09 07:01:43,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:43,927 INFO L124 PetriNetUnfolderBase]: 135/821 cut-off events. [2024-11-09 07:01:43,927 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:43,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 821 events. 135/821 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3493 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 194 conditions per place. [2024-11-09 07:01:43,930 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 16 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2024-11-09 07:01:43,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 735 flow [2024-11-09 07:01:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-11-09 07:01:43,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-11-09 07:01:43,933 INFO L175 Difference]: Start difference. First operand has 347 places, 346 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2024-11-09 07:01:43,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 735 flow [2024-11-09 07:01:43,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 345 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:43,937 INFO L231 Difference]: Finished difference. Result has 347 places, 345 transitions, 702 flow [2024-11-09 07:01:43,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=347, PETRI_TRANSITIONS=345} [2024-11-09 07:01:43,939 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2024-11-09 07:01:43,939 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 345 transitions, 702 flow [2024-11-09 07:01:43,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:43,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:43,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:01:43,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:43,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 509013339, now seen corresponding path program 1 times [2024-11-09 07:01:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:43,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986696743] [2024-11-09 07:01:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:43,978 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:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986696743] [2024-11-09 07:01:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986696743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:43,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:43,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082326055] [2024-11-09 07:01:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:43,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:43,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-11-09 07:01:43,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 345 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:43,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:43,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-11-09 07:01:43,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:44,091 INFO L124 PetriNetUnfolderBase]: 135/820 cut-off events. [2024-11-09 07:01:44,092 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:44,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 820 events. 135/820 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3491 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 192 conditions per place. [2024-11-09 07:01:44,097 INFO L140 encePairwiseOnDemand]: 458/460 looper letters, 15 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2024-11-09 07:01:44,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 344 transitions, 732 flow [2024-11-09 07:01:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2024-11-09 07:01:44,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803623188405797 [2024-11-09 07:01:44,099 INFO L175 Difference]: Start difference. First operand has 347 places, 345 transitions, 702 flow. Second operand 3 states and 1109 transitions. [2024-11-09 07:01:44,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 344 transitions, 732 flow [2024-11-09 07:01:44,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:44,104 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 698 flow [2024-11-09 07:01:44,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2024-11-09 07:01:44,106 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2024-11-09 07:01:44,107 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 698 flow [2024-11-09 07:01:44,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:44,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:44,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:01:44,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:44,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash -86622875, now seen corresponding path program 1 times [2024-11-09 07:01:44,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784630302] [2024-11-09 07:01:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:44,151 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:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784630302] [2024-11-09 07:01:44,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784630302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:44,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:44,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:44,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231978547] [2024-11-09 07:01:44,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:44,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:44,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:44,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:44,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-11-09 07:01:44,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:44,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-11-09 07:01:44,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:44,263 INFO L124 PetriNetUnfolderBase]: 135/819 cut-off events. [2024-11-09 07:01:44,264 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:44,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 819 events. 135/819 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3486 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 194 conditions per place. [2024-11-09 07:01:44,268 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 16 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2024-11-09 07:01:44,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 343 transitions, 732 flow [2024-11-09 07:01:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-11-09 07:01:44,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-11-09 07:01:44,271 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 698 flow. Second operand 3 states and 1102 transitions. [2024-11-09 07:01:44,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 343 transitions, 732 flow [2024-11-09 07:01:44,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 343 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:44,276 INFO L231 Difference]: Finished difference. Result has 346 places, 343 transitions, 699 flow [2024-11-09 07:01:44,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=346, PETRI_TRANSITIONS=343} [2024-11-09 07:01:44,277 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2024-11-09 07:01:44,277 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 343 transitions, 699 flow [2024-11-09 07:01:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:44,279 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:01:44,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:44,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1786793926, now seen corresponding path program 1 times [2024-11-09 07:01:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790045578] [2024-11-09 07:01:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:44,324 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:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:44,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790045578] [2024-11-09 07:01:44,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790045578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:44,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742164222] [2024-11-09 07:01:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:44,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:44,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:44,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:44,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 343 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:44,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:44,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:44,446 INFO L124 PetriNetUnfolderBase]: 135/818 cut-off events. [2024-11-09 07:01:44,447 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:44,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 818 events. 135/818 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3487 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 976. Up to 195 conditions per place. [2024-11-09 07:01:44,451 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2024-11-09 07:01:44,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 735 flow [2024-11-09 07:01:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-11-09 07:01:44,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-11-09 07:01:44,453 INFO L175 Difference]: Start difference. First operand has 346 places, 343 transitions, 699 flow. Second operand 3 states and 1100 transitions. [2024-11-09 07:01:44,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 735 flow [2024-11-09 07:01:44,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 342 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:44,457 INFO L231 Difference]: Finished difference. Result has 345 places, 342 transitions, 697 flow [2024-11-09 07:01:44,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=345, PETRI_TRANSITIONS=342} [2024-11-09 07:01:44,460 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -84 predicate places. [2024-11-09 07:01:44,460 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 342 transitions, 697 flow [2024-11-09 07:01:44,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:44,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:44,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:01:44,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:44,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:44,461 INFO L85 PathProgramCache]: Analyzing trace with hash -415536618, now seen corresponding path program 1 times [2024-11-09 07:01:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001317351] [2024-11-09 07:01:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:44,500 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:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001317351] [2024-11-09 07:01:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001317351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:44,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82566948] [2024-11-09 07:01:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:44,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:44,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:44,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 342 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:44,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:44,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:44,617 INFO L124 PetriNetUnfolderBase]: 135/817 cut-off events. [2024-11-09 07:01:44,618 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:44,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 817 events. 135/817 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3484 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 195 conditions per place. [2024-11-09 07:01:44,622 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2024-11-09 07:01:44,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 341 transitions, 733 flow [2024-11-09 07:01:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-11-09 07:01:44,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-11-09 07:01:44,625 INFO L175 Difference]: Start difference. First operand has 345 places, 342 transitions, 697 flow. Second operand 3 states and 1100 transitions. [2024-11-09 07:01:44,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 341 transitions, 733 flow [2024-11-09 07:01:44,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 341 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:44,630 INFO L231 Difference]: Finished difference. Result has 344 places, 341 transitions, 695 flow [2024-11-09 07:01:44,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=344, PETRI_TRANSITIONS=341} [2024-11-09 07:01:44,631 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -85 predicate places. [2024-11-09 07:01:44,631 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 341 transitions, 695 flow [2024-11-09 07:01:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:44,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:44,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:01:44,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:44,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1119558372, now seen corresponding path program 1 times [2024-11-09 07:01:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:44,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999287075] [2024-11-09 07:01:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:44,679 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:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:44,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999287075] [2024-11-09 07:01:44,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999287075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:44,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:44,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848798018] [2024-11-09 07:01:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:44,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:44,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:44,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 341 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:44,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:44,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:44,834 INFO L124 PetriNetUnfolderBase]: 135/816 cut-off events. [2024-11-09 07:01:44,835 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:01:44,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 816 events. 135/816 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3484 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 195 conditions per place. [2024-11-09 07:01:44,839 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2024-11-09 07:01:44,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 340 transitions, 731 flow [2024-11-09 07:01:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-11-09 07:01:44,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-11-09 07:01:44,842 INFO L175 Difference]: Start difference. First operand has 344 places, 341 transitions, 695 flow. Second operand 3 states and 1100 transitions. [2024-11-09 07:01:44,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 340 transitions, 731 flow [2024-11-09 07:01:44,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 340 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:44,847 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 693 flow [2024-11-09 07:01:44,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2024-11-09 07:01:44,848 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-11-09 07:01:44,848 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 693 flow [2024-11-09 07:01:44,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:44,849 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:01:44,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:44,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -344290931, now seen corresponding path program 1 times [2024-11-09 07:01:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438449323] [2024-11-09 07:01:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:44,901 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:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438449323] [2024-11-09 07:01:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438449323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228087442] [2024-11-09 07:01:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:44,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:44,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-11-09 07:01:44,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:44,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:44,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-11-09 07:01:44,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:45,021 INFO L124 PetriNetUnfolderBase]: 127/717 cut-off events. [2024-11-09 07:01:45,021 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 07:01:45,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 717 events. 127/717 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2662 event pairs, 14 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 868. Up to 141 conditions per place. [2024-11-09 07:01:45,025 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 22 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2024-11-09 07:01:45,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 757 flow [2024-11-09 07:01:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2024-11-09 07:01:45,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8094202898550724 [2024-11-09 07:01:45,027 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 693 flow. Second operand 3 states and 1117 transitions. [2024-11-09 07:01:45,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 757 flow [2024-11-09 07:01:45,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:45,033 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 697 flow [2024-11-09 07:01:45,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2024-11-09 07:01:45,034 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-11-09 07:01:45,034 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 697 flow [2024-11-09 07:01:45,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:45,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:45,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:01:45,035 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:45,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 875678034, now seen corresponding path program 1 times [2024-11-09 07:01:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999872770] [2024-11-09 07:01:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:45,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:45,074 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:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999872770] [2024-11-09 07:01:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999872770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:45,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107235774] [2024-11-09 07:01:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:45,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:45,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:45,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:45,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-11-09 07:01:45,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:45,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-11-09 07:01:45,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:45,184 INFO L124 PetriNetUnfolderBase]: 136/821 cut-off events. [2024-11-09 07:01:45,185 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-09 07:01:45,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 821 events. 136/821 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3576 event pairs, 74 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 1038. Up to 198 conditions per place. [2024-11-09 07:01:45,190 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 17 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2024-11-09 07:01:45,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 733 flow [2024-11-09 07:01:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-11-09 07:01:45,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-11-09 07:01:45,192 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 697 flow. Second operand 3 states and 1102 transitions. [2024-11-09 07:01:45,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 733 flow [2024-11-09 07:01:45,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 339 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:45,197 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 697 flow [2024-11-09 07:01:45,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2024-11-09 07:01:45,198 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-11-09 07:01:45,205 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 697 flow [2024-11-09 07:01:45,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:45,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:45,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:01:45,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash -305279223, now seen corresponding path program 1 times [2024-11-09 07:01:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006673292] [2024-11-09 07:01:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:45,256 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:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:45,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006673292] [2024-11-09 07:01:45,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006673292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:45,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693629508] [2024-11-09 07:01:45,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:45,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:45,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:45,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:45,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-11-09 07:01:45,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:45,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-11-09 07:01:45,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:45,393 INFO L124 PetriNetUnfolderBase]: 137/782 cut-off events. [2024-11-09 07:01:45,393 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-09 07:01:45,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 782 events. 137/782 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3168 event pairs, 28 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 985. Up to 119 conditions per place. [2024-11-09 07:01:45,397 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 24 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2024-11-09 07:01:45,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 771 flow [2024-11-09 07:01:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2024-11-09 07:01:45,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8094202898550724 [2024-11-09 07:01:45,399 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 697 flow. Second operand 3 states and 1117 transitions. [2024-11-09 07:01:45,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 771 flow [2024-11-09 07:01:45,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:45,403 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 701 flow [2024-11-09 07:01:45,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2024-11-09 07:01:45,404 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-11-09 07:01:45,404 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 701 flow [2024-11-09 07:01:45,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:45,405 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:45,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:01:45,405 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1473824724, now seen corresponding path program 1 times [2024-11-09 07:01:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341913736] [2024-11-09 07:01:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:45,440 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:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341913736] [2024-11-09 07:01:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341913736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:45,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836836690] [2024-11-09 07:01:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:45,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:45,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:45,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-11-09 07:01:45,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:45,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-11-09 07:01:45,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:45,554 INFO L124 PetriNetUnfolderBase]: 137/826 cut-off events. [2024-11-09 07:01:45,554 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-09 07:01:45,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 826 events. 137/826 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3619 event pairs, 74 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1077. Up to 202 conditions per place. [2024-11-09 07:01:45,565 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 18 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2024-11-09 07:01:45,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 338 transitions, 739 flow [2024-11-09 07:01:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-11-09 07:01:45,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-11-09 07:01:45,567 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2024-11-09 07:01:45,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 338 transitions, 739 flow [2024-11-09 07:01:45,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 338 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:45,572 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 701 flow [2024-11-09 07:01:45,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2024-11-09 07:01:45,573 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-11-09 07:01:45,573 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 701 flow [2024-11-09 07:01:45,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:45,574 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:45,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:01:45,574 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash 740267762, now seen corresponding path program 1 times [2024-11-09 07:01:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830460752] [2024-11-09 07:01:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:45,616 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:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830460752] [2024-11-09 07:01:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830460752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:45,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724681877] [2024-11-09 07:01:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:45,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 460 [2024-11-09 07:01:45,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:45,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 460 [2024-11-09 07:01:45,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:45,768 INFO L124 PetriNetUnfolderBase]: 196/990 cut-off events. [2024-11-09 07:01:45,768 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-09 07:01:45,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 990 events. 196/990 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4783 event pairs, 56 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1375. Up to 163 conditions per place. [2024-11-09 07:01:45,773 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 30 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2024-11-09 07:01:45,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 351 transitions, 804 flow [2024-11-09 07:01:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1121 transitions. [2024-11-09 07:01:45,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8123188405797102 [2024-11-09 07:01:45,776 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 701 flow. Second operand 3 states and 1121 transitions. [2024-11-09 07:01:45,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 351 transitions, 804 flow [2024-11-09 07:01:45,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 351 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:45,808 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 705 flow [2024-11-09 07:01:45,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2024-11-09 07:01:45,809 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-11-09 07:01:45,809 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 705 flow [2024-11-09 07:01:45,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:45,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:45,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:01:45,810 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:45,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:45,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1467867554, now seen corresponding path program 1 times [2024-11-09 07:01:45,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:45,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660329711] [2024-11-09 07:01:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:45,851 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:45,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:45,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660329711] [2024-11-09 07:01:45,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660329711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:45,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:45,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:45,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184519131] [2024-11-09 07:01:45,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:45,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:45,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:45,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:45,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-11-09 07:01:45,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:45,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:45,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-11-09 07:01:45,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:45,991 INFO L124 PetriNetUnfolderBase]: 196/1004 cut-off events. [2024-11-09 07:01:45,992 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2024-11-09 07:01:45,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1004 events. 196/1004 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4847 event pairs, 124 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1428. Up to 301 conditions per place. [2024-11-09 07:01:45,997 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 19 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2024-11-09 07:01:45,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 337 transitions, 745 flow [2024-11-09 07:01:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-11-09 07:01:45,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-11-09 07:01:45,999 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 705 flow. Second operand 3 states and 1102 transitions. [2024-11-09 07:01:45,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 337 transitions, 745 flow [2024-11-09 07:01:46,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 337 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:46,003 INFO L231 Difference]: Finished difference. Result has 343 places, 337 transitions, 705 flow [2024-11-09 07:01:46,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=337} [2024-11-09 07:01:46,004 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2024-11-09 07:01:46,004 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 337 transitions, 705 flow [2024-11-09 07:01:46,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:46,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:01:46,005 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:46,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2112773445, now seen corresponding path program 1 times [2024-11-09 07:01:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888064150] [2024-11-09 07:01:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:46,041 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:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888064150] [2024-11-09 07:01:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888064150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:46,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:46,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:46,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050761266] [2024-11-09 07:01:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:46,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:46,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2024-11-09 07:01:46,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 337 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:46,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2024-11-09 07:01:46,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:46,233 INFO L124 PetriNetUnfolderBase]: 296/1261 cut-off events. [2024-11-09 07:01:46,233 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-09 07:01:46,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 1261 events. 296/1261 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6757 event pairs, 196 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1896. Up to 451 conditions per place. [2024-11-09 07:01:46,238 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 20 selfloop transitions, 1 changer transitions 0/335 dead transitions. [2024-11-09 07:01:46,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 335 transitions, 743 flow [2024-11-09 07:01:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2024-11-09 07:01:46,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7992753623188406 [2024-11-09 07:01:46,240 INFO L175 Difference]: Start difference. First operand has 343 places, 337 transitions, 705 flow. Second operand 3 states and 1103 transitions. [2024-11-09 07:01:46,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 335 transitions, 743 flow [2024-11-09 07:01:46,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 335 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:46,244 INFO L231 Difference]: Finished difference. Result has 341 places, 335 transitions, 699 flow [2024-11-09 07:01:46,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=341, PETRI_TRANSITIONS=335} [2024-11-09 07:01:46,245 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2024-11-09 07:01:46,245 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 335 transitions, 699 flow [2024-11-09 07:01:46,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:46,246 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:46,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:01:46,246 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -374015194, now seen corresponding path program 1 times [2024-11-09 07:01:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308649803] [2024-11-09 07:01:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:46,285 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:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:46,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308649803] [2024-11-09 07:01:46,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308649803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:46,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769985140] [2024-11-09 07:01:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:46,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:46,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:46,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:46,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 335 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:46,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:46,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:46,482 INFO L124 PetriNetUnfolderBase]: 346/1327 cut-off events. [2024-11-09 07:01:46,483 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2024-11-09 07:01:46,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 1327 events. 346/1327 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7177 event pairs, 196 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2073. Up to 452 conditions per place. [2024-11-09 07:01:46,489 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 29 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2024-11-09 07:01:46,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 785 flow [2024-11-09 07:01:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2024-11-09 07:01:46,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8021739130434783 [2024-11-09 07:01:46,491 INFO L175 Difference]: Start difference. First operand has 341 places, 335 transitions, 699 flow. Second operand 3 states and 1107 transitions. [2024-11-09 07:01:46,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 785 flow [2024-11-09 07:01:46,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:46,496 INFO L231 Difference]: Finished difference. Result has 341 places, 334 transitions, 700 flow [2024-11-09 07:01:46,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=341, PETRI_TRANSITIONS=334} [2024-11-09 07:01:46,497 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2024-11-09 07:01:46,497 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 334 transitions, 700 flow [2024-11-09 07:01:46,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:46,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:01:46,499 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:46,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2110388512, now seen corresponding path program 1 times [2024-11-09 07:01:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:46,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732459395] [2024-11-09 07:01:46,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:46,551 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:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:46,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732459395] [2024-11-09 07:01:46,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732459395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:46,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:46,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:46,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244979333] [2024-11-09 07:01:46,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:46,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:46,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:46,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:46,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:46,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 334 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:46,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:46,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:46,799 INFO L124 PetriNetUnfolderBase]: 296/1175 cut-off events. [2024-11-09 07:01:46,799 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2024-11-09 07:01:46,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1175 events. 296/1175 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5884 event pairs, 160 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 1823. Up to 374 conditions per place. [2024-11-09 07:01:46,805 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 22 selfloop transitions, 2 changer transitions 7/340 dead transitions. [2024-11-09 07:01:46,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 340 transitions, 780 flow [2024-11-09 07:01:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2024-11-09 07:01:46,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8014492753623188 [2024-11-09 07:01:46,807 INFO L175 Difference]: Start difference. First operand has 341 places, 334 transitions, 700 flow. Second operand 3 states and 1106 transitions. [2024-11-09 07:01:46,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 340 transitions, 780 flow [2024-11-09 07:01:46,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 340 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:46,812 INFO L231 Difference]: Finished difference. Result has 339 places, 325 transitions, 679 flow [2024-11-09 07:01:46,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=339, PETRI_TRANSITIONS=325} [2024-11-09 07:01:46,813 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -90 predicate places. [2024-11-09 07:01:46,813 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 325 transitions, 679 flow [2024-11-09 07:01:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:46,814 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:46,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:01:46,814 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2024-11-09 07:01:46,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash -603848605, now seen corresponding path program 1 times [2024-11-09 07:01:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:46,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150787647] [2024-11-09 07:01:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:46,879 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:46,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:46,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150787647] [2024-11-09 07:01:46,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150787647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:46,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:46,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:46,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300328232] [2024-11-09 07:01:46,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:46,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:46,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:46,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:46,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 460 [2024-11-09 07:01:46,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 325 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:46,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:46,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 460 [2024-11-09 07:01:46,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:47,093 INFO L124 PetriNetUnfolderBase]: 254/990 cut-off events. [2024-11-09 07:01:47,094 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-09 07:01:47,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 990 events. 254/990 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4382 event pairs, 132 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1552. Up to 306 conditions per place. [2024-11-09 07:01:47,097 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 0 selfloop transitions, 0 changer transitions 332/332 dead transitions. [2024-11-09 07:01:47,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 332 transitions, 755 flow [2024-11-09 07:01:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2024-11-09 07:01:47,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985507246376812 [2024-11-09 07:01:47,100 INFO L175 Difference]: Start difference. First operand has 339 places, 325 transitions, 679 flow. Second operand 3 states and 1102 transitions. [2024-11-09 07:01:47,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 332 transitions, 755 flow [2024-11-09 07:01:47,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 332 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:47,104 INFO L231 Difference]: Finished difference. Result has 331 places, 0 transitions, 0 flow [2024-11-09 07:01:47,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=331, PETRI_TRANSITIONS=0} [2024-11-09 07:01:47,105 INFO L277 CegarLoopForPetriNet]: 429 programPoint places, -98 predicate places. [2024-11-09 07:01:47,105 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 0 transitions, 0 flow [2024-11-09 07:01:47,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining) [2024-11-09 07:01:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining) [2024-11-09 07:01:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining) [2024-11-09 07:01:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining) [2024-11-09 07:01:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining) [2024-11-09 07:01:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining) [2024-11-09 07:01:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining) [2024-11-09 07:01:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining) [2024-11-09 07:01:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining) [2024-11-09 07:01:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining) [2024-11-09 07:01:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining) [2024-11-09 07:01:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining) [2024-11-09 07:01:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining) [2024-11-09 07:01:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining) [2024-11-09 07:01:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining) [2024-11-09 07:01:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining) [2024-11-09 07:01:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining) [2024-11-09 07:01:47,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining) [2024-11-09 07:01:47,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining) [2024-11-09 07:01:47,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining) [2024-11-09 07:01:47,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining) [2024-11-09 07:01:47,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining) [2024-11-09 07:01:47,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining) [2024-11-09 07:01:47,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining) [2024-11-09 07:01:47,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining) [2024-11-09 07:01:47,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining) [2024-11-09 07:01:47,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining) [2024-11-09 07:01:47,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining) [2024-11-09 07:01:47,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining) [2024-11-09 07:01:47,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining) [2024-11-09 07:01:47,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining) [2024-11-09 07:01:47,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining) [2024-11-09 07:01:47,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining) [2024-11-09 07:01:47,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining) [2024-11-09 07:01:47,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining) [2024-11-09 07:01:47,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining) [2024-11-09 07:01:47,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining) [2024-11-09 07:01:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining) [2024-11-09 07:01:47,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining) [2024-11-09 07:01:47,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining) [2024-11-09 07:01:47,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining) [2024-11-09 07:01:47,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining) [2024-11-09 07:01:47,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining) [2024-11-09 07:01:47,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining) [2024-11-09 07:01:47,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining) [2024-11-09 07:01:47,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining) [2024-11-09 07:01:47,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining) [2024-11-09 07:01:47,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining) [2024-11-09 07:01:47,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining) [2024-11-09 07:01:47,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining) [2024-11-09 07:01:47,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining) [2024-11-09 07:01:47,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining) [2024-11-09 07:01:47,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining) [2024-11-09 07:01:47,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining) [2024-11-09 07:01:47,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining) [2024-11-09 07:01:47,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining) [2024-11-09 07:01:47,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining) [2024-11-09 07:01:47,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining) [2024-11-09 07:01:47,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining) [2024-11-09 07:01:47,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining) [2024-11-09 07:01:47,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining) [2024-11-09 07:01:47,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining) [2024-11-09 07:01:47,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining) [2024-11-09 07:01:47,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining) [2024-11-09 07:01:47,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining) [2024-11-09 07:01:47,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining) [2024-11-09 07:01:47,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining) [2024-11-09 07:01:47,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining) [2024-11-09 07:01:47,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining) [2024-11-09 07:01:47,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining) [2024-11-09 07:01:47,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining) [2024-11-09 07:01:47,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining) [2024-11-09 07:01:47,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining) [2024-11-09 07:01:47,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining) [2024-11-09 07:01:47,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining) [2024-11-09 07:01:47,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining) [2024-11-09 07:01:47,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining) [2024-11-09 07:01:47,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining) [2024-11-09 07:01:47,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining) [2024-11-09 07:01:47,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining) [2024-11-09 07:01:47,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining) [2024-11-09 07:01:47,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining) [2024-11-09 07:01:47,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining) [2024-11-09 07:01:47,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining) [2024-11-09 07:01:47,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining) [2024-11-09 07:01:47,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining) [2024-11-09 07:01:47,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining) [2024-11-09 07:01:47,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining) [2024-11-09 07:01:47,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining) [2024-11-09 07:01:47,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining) [2024-11-09 07:01:47,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining) [2024-11-09 07:01:47,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining) [2024-11-09 07:01:47,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining) [2024-11-09 07:01:47,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining) [2024-11-09 07:01:47,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining) [2024-11-09 07:01:47,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining) [2024-11-09 07:01:47,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining) [2024-11-09 07:01:47,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining) [2024-11-09 07:01:47,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining) [2024-11-09 07:01:47,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining) [2024-11-09 07:01:47,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining) [2024-11-09 07:01:47,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining) [2024-11-09 07:01:47,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining) [2024-11-09 07:01:47,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining) [2024-11-09 07:01:47,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining) [2024-11-09 07:01:47,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining) [2024-11-09 07:01:47,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining) [2024-11-09 07:01:47,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining) [2024-11-09 07:01:47,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining) [2024-11-09 07:01:47,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining) [2024-11-09 07:01:47,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining) [2024-11-09 07:01:47,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining) [2024-11-09 07:01:47,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining) [2024-11-09 07:01:47,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining) [2024-11-09 07:01:47,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining) [2024-11-09 07:01:47,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining) [2024-11-09 07:01:47,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining) [2024-11-09 07:01:47,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining) [2024-11-09 07:01:47,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining) [2024-11-09 07:01:47,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining) [2024-11-09 07:01:47,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining) [2024-11-09 07:01:47,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining) [2024-11-09 07:01:47,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining) [2024-11-09 07:01:47,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining) [2024-11-09 07:01:47,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining) [2024-11-09 07:01:47,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining) [2024-11-09 07:01:47,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining) [2024-11-09 07:01:47,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining) [2024-11-09 07:01:47,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining) [2024-11-09 07:01:47,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining) [2024-11-09 07:01:47,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining) [2024-11-09 07:01:47,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining) [2024-11-09 07:01:47,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:01:47,132 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:47,137 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:01:47,138 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:01:47,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:01:47 BasicIcfg [2024-11-09 07:01:47,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:01:47,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:01:47,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:01:47,143 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:01:47,144 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:40" (3/4) ... [2024-11-09 07:01:47,145 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:01:47,147 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:01:47,148 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:01:47,148 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 07:01:47,154 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-09 07:01:47,154 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:01:47,155 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:01:47,155 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:01:47,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:01:47,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:01:47,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:01:47,271 INFO L158 Benchmark]: Toolchain (without parser) took 8272.32ms. Allocated memory was 184.5MB in the beginning and 775.9MB in the end (delta: 591.4MB). Free memory was 111.6MB in the beginning and 468.6MB in the end (delta: -357.0MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:47,271 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:01:47,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.80ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 95.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:01:47,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.32ms. Allocated memory is still 184.5MB. Free memory was 95.5MB in the beginning and 152.3MB in the end (delta: -56.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-09 07:01:47,272 INFO L158 Benchmark]: Boogie Preprocessor took 100.52ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 149.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:47,272 INFO L158 Benchmark]: RCFGBuilder took 1306.71ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 149.0MB in the beginning and 168.1MB in the end (delta: -19.1MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2024-11-09 07:01:47,272 INFO L158 Benchmark]: TraceAbstraction took 6268.34ms. Allocated memory was 289.4MB in the beginning and 775.9MB in the end (delta: 486.5MB). Free memory was 168.1MB in the beginning and 475.9MB in the end (delta: -307.9MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. [2024-11-09 07:01:47,273 INFO L158 Benchmark]: Witness Printer took 127.36ms. Allocated memory is still 775.9MB. Free memory was 475.9MB in the beginning and 468.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 07:01:47,274 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.16ms. Allocated memory is still 184.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.80ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 95.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.32ms. Allocated memory is still 184.5MB. Free memory was 95.5MB in the beginning and 152.3MB in the end (delta: -56.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.52ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 149.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1306.71ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 149.0MB in the beginning and 168.1MB in the end (delta: -19.1MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6268.34ms. Allocated memory was 289.4MB in the beginning and 775.9MB in the end (delta: 486.5MB). Free memory was 168.1MB in the beginning and 475.9MB in the end (delta: -307.9MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. * Witness Printer took 127.36ms. Allocated memory is still 775.9MB. Free memory was 475.9MB in the beginning and 468.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 557 locations, 159 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1095 IncrementalHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 77 mSDtfsCounter, 1095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=898occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 3487 NumberOfCodeBlocks, 3487 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3463 ConstructedInterpolants, 0 QuantifiedInterpolants, 3624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 90 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:01:47,299 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