./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:17:31,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:17:31,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:17:31,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:17:31,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:17:31,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:17:31,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:17:31,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:17:31,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:17:31,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:17:31,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:17:31,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:17:31,478 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:17:31,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:17:31,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:17:31,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:17:31,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:17:31,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:17:31,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:17:31,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:17:31,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:17:31,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:17:31,485 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:17:31,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:17:31,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:17:31,485 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:17:31,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:17:31,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:17:31,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:17:31,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:17:31,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:17:31,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:31,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:17:31,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:17:31,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:17:31,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:17:31,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:17:31,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:17:31,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:17:31,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:17:31,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:17:31,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2024-10-11 17:17:31,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:17:31,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:17:31,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:17:31,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:17:31,754 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:17:31,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-10-11 17:17:33,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:17:33,375 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:17:33,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-10-11 17:17:33,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b01eaf53/c273e74c826b4d63ad93efe5a34c280a/FLAGc03082729 [2024-10-11 17:17:33,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b01eaf53/c273e74c826b4d63ad93efe5a34c280a [2024-10-11 17:17:33,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:17:33,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:17:33,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:33,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:17:33,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:17:33,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55eba7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:33, skipping insertion in model container [2024-10-11 17:17:33,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:33" (1/1) ... [2024-10-11 17:17:33,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:17:34,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:34,047 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:17:34,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:34,098 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:17:34,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34 WrapperNode [2024-10-11 17:17:34,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:34,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:34,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:17:34,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:17:34,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,174 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 410 [2024-10-11 17:17:34,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:34,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:17:34,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:17:34,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:17:34,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:17:34,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:17:34,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:17:34,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:17:34,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (1/1) ... [2024-10-11 17:17:34,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:34,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:17:34,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:17:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:17:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:17:34,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:17:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:17:34,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:17:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:17:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:17:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:17:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:17:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:17:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:17:34,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:17:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:17:34,336 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:17:34,460 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:17:34,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:17:35,196 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:17:35,196 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:17:35,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:17:35,625 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:17:35,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:35 BoogieIcfgContainer [2024-10-11 17:17:35,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:17:35,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:17:35,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:17:35,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:17:35,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:17:33" (1/3) ... [2024-10-11 17:17:35,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6318d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:35, skipping insertion in model container [2024-10-11 17:17:35,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:34" (2/3) ... [2024-10-11 17:17:35,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6318d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:35, skipping insertion in model container [2024-10-11 17:17:35,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:35" (3/3) ... [2024-10-11 17:17:35,635 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-10-11 17:17:35,652 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:17:35,653 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-11 17:17:35,653 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:17:35,743 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:17:35,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 326 transitions, 666 flow [2024-10-11 17:17:35,879 INFO L124 PetriNetUnfolderBase]: 13/324 cut-off events. [2024-10-11 17:17:35,879 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:17:35,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 324 events. 13/324 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 493 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 254. Up to 2 conditions per place. [2024-10-11 17:17:35,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 326 transitions, 666 flow [2024-10-11 17:17:35,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 307 transitions, 626 flow [2024-10-11 17:17:35,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:17:35,916 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;@67352c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:17:35,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 115 error locations. [2024-10-11 17:17:35,927 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:17:35,927 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-11 17:17:35,927 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:17:35,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,928 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] [2024-10-11 17:17:35,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1838123497, now seen corresponding path program 1 times [2024-10-11 17:17:35,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538024854] [2024-10-11 17:17:35,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538024854] [2024-10-11 17:17:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538024854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318103101] [2024-10-11 17:17:36,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 326 [2024-10-11 17:17:36,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 307 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 326 [2024-10-11 17:17:36,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,390 INFO L124 PetriNetUnfolderBase]: 27/412 cut-off events. [2024-10-11 17:17:36,391 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-11 17:17:36,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 412 events. 27/412 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1082 event pairs, 15 based on Foata normal form. 23/373 useless extension candidates. Maximal degree in co-relation 235. Up to 52 conditions per place. [2024-10-11 17:17:36,399 INFO L140 encePairwiseOnDemand]: 275/326 looper letters, 13 selfloop transitions, 2 changer transitions 4/258 dead transitions. [2024-10-11 17:17:36,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 258 transitions, 558 flow [2024-10-11 17:17:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2024-10-11 17:17:36,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8599182004089979 [2024-10-11 17:17:36,424 INFO L175 Difference]: Start difference. First operand has 302 places, 307 transitions, 626 flow. Second operand 3 states and 841 transitions. [2024-10-11 17:17:36,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 258 transitions, 558 flow [2024-10-11 17:17:36,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 550 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:17:36,435 INFO L231 Difference]: Finished difference. Result has 259 places, 254 transitions, 516 flow [2024-10-11 17:17:36,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=259, PETRI_TRANSITIONS=254} [2024-10-11 17:17:36,443 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -43 predicate places. [2024-10-11 17:17:36,444 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 254 transitions, 516 flow [2024-10-11 17:17:36,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,445 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] [2024-10-11 17:17:36,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:17:36,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:36,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1538491648, now seen corresponding path program 1 times [2024-10-11 17:17:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425433244] [2024-10-11 17:17:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425433244] [2024-10-11 17:17:36,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425433244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918594379] [2024-10-11 17:17:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-11 17:17:36,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 254 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-11 17:17:36,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,635 INFO L124 PetriNetUnfolderBase]: 22/386 cut-off events. [2024-10-11 17:17:36,636 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:17:36,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 386 events. 22/386 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 860 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 399. Up to 38 conditions per place. [2024-10-11 17:17:36,638 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-10-11 17:17:36,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 253 transitions, 542 flow [2024-10-11 17:17:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-11 17:17:36,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-11 17:17:36,642 INFO L175 Difference]: Start difference. First operand has 259 places, 254 transitions, 516 flow. Second operand 3 states and 795 transitions. [2024-10-11 17:17:36,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 253 transitions, 542 flow [2024-10-11 17:17:36,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 253 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:36,649 INFO L231 Difference]: Finished difference. Result has 254 places, 253 transitions, 514 flow [2024-10-11 17:17:36,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=254, PETRI_TRANSITIONS=253} [2024-10-11 17:17:36,651 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -48 predicate places. [2024-10-11 17:17:36,651 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 253 transitions, 514 flow [2024-10-11 17:17:36,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,652 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] [2024-10-11 17:17:36,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:17:36,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1000939298, now seen corresponding path program 1 times [2024-10-11 17:17:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534429514] [2024-10-11 17:17:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534429514] [2024-10-11 17:17:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534429514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835491868] [2024-10-11 17:17:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-11 17:17:36,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 253 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-11 17:17:36,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,811 INFO L124 PetriNetUnfolderBase]: 22/385 cut-off events. [2024-10-11 17:17:36,812 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:17:36,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 385 events. 22/385 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 861 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 390. Up to 38 conditions per place. [2024-10-11 17:17:36,814 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-10-11 17:17:36,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 252 transitions, 540 flow [2024-10-11 17:17:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-11 17:17:36,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-11 17:17:36,817 INFO L175 Difference]: Start difference. First operand has 254 places, 253 transitions, 514 flow. Second operand 3 states and 795 transitions. [2024-10-11 17:17:36,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 252 transitions, 540 flow [2024-10-11 17:17:36,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 252 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:36,822 INFO L231 Difference]: Finished difference. Result has 253 places, 252 transitions, 512 flow [2024-10-11 17:17:36,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=253, PETRI_TRANSITIONS=252} [2024-10-11 17:17:36,823 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -49 predicate places. [2024-10-11 17:17:36,823 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 252 transitions, 512 flow [2024-10-11 17:17:36,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,824 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] [2024-10-11 17:17:36,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:17:36,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:36,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2004412426, now seen corresponding path program 1 times [2024-10-11 17:17:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024643963] [2024-10-11 17:17:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,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-10-11 17:17:36,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024643963] [2024-10-11 17:17:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024643963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663161442] [2024-10-11 17:17:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-11 17:17:36,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 252 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-11 17:17:36,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,959 INFO L124 PetriNetUnfolderBase]: 22/384 cut-off events. [2024-10-11 17:17:36,959 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:17:36,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 384 events. 22/384 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 861 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 381. Up to 38 conditions per place. [2024-10-11 17:17:36,962 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-10-11 17:17:36,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 251 transitions, 538 flow [2024-10-11 17:17:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-11 17:17:36,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-11 17:17:36,964 INFO L175 Difference]: Start difference. First operand has 253 places, 252 transitions, 512 flow. Second operand 3 states and 795 transitions. [2024-10-11 17:17:36,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 251 transitions, 538 flow [2024-10-11 17:17:36,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 251 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:36,969 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 510 flow [2024-10-11 17:17:36,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2024-10-11 17:17:36,970 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-11 17:17:36,970 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 510 flow [2024-10-11 17:17:36,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:17:36,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:36,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1088211231, now seen corresponding path program 1 times [2024-10-11 17:17:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740133658] [2024-10-11 17:17:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740133658] [2024-10-11 17:17:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740133658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935340923] [2024-10-11 17:17:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:37,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-11 17:17:37,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:37,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-11 17:17:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:37,182 INFO L124 PetriNetUnfolderBase]: 23/408 cut-off events. [2024-10-11 17:17:37,182 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-11 17:17:37,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 408 events. 23/408 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1072 event pairs, 5 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 405. Up to 26 conditions per place. [2024-10-11 17:17:37,185 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 16 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-10-11 17:17:37,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 561 flow [2024-10-11 17:17:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2024-10-11 17:17:37,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8292433537832311 [2024-10-11 17:17:37,189 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 510 flow. Second operand 3 states and 811 transitions. [2024-10-11 17:17:37,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 561 flow [2024-10-11 17:17:37,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:37,194 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 514 flow [2024-10-11 17:17:37,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2024-10-11 17:17:37,196 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-11 17:17:37,197 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 514 flow [2024-10-11 17:17:37,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:37,199 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:37,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:17:37,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:37,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2026420870, now seen corresponding path program 1 times [2024-10-11 17:17:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:37,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713139071] [2024-10-11 17:17:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713139071] [2024-10-11 17:17:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713139071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:37,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276697717] [2024-10-11 17:17:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:37,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:37,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:37,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-11 17:17:37,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:37,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-11 17:17:37,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:37,387 INFO L124 PetriNetUnfolderBase]: 27/453 cut-off events. [2024-10-11 17:17:37,388 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-11 17:17:37,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 453 events. 27/453 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1200 event pairs, 13 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 266. Up to 51 conditions per place. [2024-10-11 17:17:37,390 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-10-11 17:17:37,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 540 flow [2024-10-11 17:17:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-11 17:17:37,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-11 17:17:37,394 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 514 flow. Second operand 3 states and 797 transitions. [2024-10-11 17:17:37,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 540 flow [2024-10-11 17:17:37,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 250 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:37,399 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 514 flow [2024-10-11 17:17:37,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2024-10-11 17:17:37,401 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-11 17:17:37,402 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 514 flow [2024-10-11 17:17:37,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:37,403 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:37,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:17:37,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 740504393, now seen corresponding path program 1 times [2024-10-11 17:17:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:37,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886823899] [2024-10-11 17:17:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886823899] [2024-10-11 17:17:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886823899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512688528] [2024-10-11 17:17:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:37,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:37,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-11 17:17:37,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:37,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-11 17:17:37,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:37,568 INFO L124 PetriNetUnfolderBase]: 27/452 cut-off events. [2024-10-11 17:17:37,569 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-11 17:17:37,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 452 events. 27/452 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1201 event pairs, 13 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 457. Up to 52 conditions per place. [2024-10-11 17:17:37,571 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-10-11 17:17:37,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 249 transitions, 542 flow [2024-10-11 17:17:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-11 17:17:37,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-11 17:17:37,574 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 514 flow. Second operand 3 states and 795 transitions. [2024-10-11 17:17:37,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 249 transitions, 542 flow [2024-10-11 17:17:37,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:37,578 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 512 flow [2024-10-11 17:17:37,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2024-10-11 17:17:37,579 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-11 17:17:37,580 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 512 flow [2024-10-11 17:17:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:37,581 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:37,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:17:37,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 932099919, now seen corresponding path program 1 times [2024-10-11 17:17:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:37,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963652501] [2024-10-11 17:17:37,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:37,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963652501] [2024-10-11 17:17:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963652501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645053879] [2024-10-11 17:17:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:37,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:37,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-11 17:17:37,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:37,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-11 17:17:37,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:37,736 INFO L124 PetriNetUnfolderBase]: 31/495 cut-off events. [2024-10-11 17:17:37,736 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-11 17:17:37,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 495 events. 31/495 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1569 event pairs, 8 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 505. Up to 34 conditions per place. [2024-10-11 17:17:37,739 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 17 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-10-11 17:17:37,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 255 transitions, 568 flow [2024-10-11 17:17:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-10-11 17:17:37,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282208588957055 [2024-10-11 17:17:37,742 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 512 flow. Second operand 3 states and 810 transitions. [2024-10-11 17:17:37,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 255 transitions, 568 flow [2024-10-11 17:17:37,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:37,746 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 516 flow [2024-10-11 17:17:37,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2024-10-11 17:17:37,749 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-11 17:17:37,750 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 516 flow [2024-10-11 17:17:37,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:37,751 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] [2024-10-11 17:17:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:17:37,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -639437959, now seen corresponding path program 1 times [2024-10-11 17:17:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416506670] [2024-10-11 17:17:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416506670] [2024-10-11 17:17:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416506670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:37,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850532260] [2024-10-11 17:17:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:37,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-11 17:17:37,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:37,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-11 17:17:37,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:37,927 INFO L124 PetriNetUnfolderBase]: 31/494 cut-off events. [2024-10-11 17:17:37,927 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-11 17:17:37,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 494 events. 31/494 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1573 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 312. Up to 65 conditions per place. [2024-10-11 17:17:37,930 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-10-11 17:17:37,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 248 transitions, 544 flow [2024-10-11 17:17:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-11 17:17:37,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-11 17:17:37,933 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 516 flow. Second operand 3 states and 797 transitions. [2024-10-11 17:17:37,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 248 transitions, 544 flow [2024-10-11 17:17:37,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 248 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:37,937 INFO L231 Difference]: Finished difference. Result has 251 places, 248 transitions, 516 flow [2024-10-11 17:17:37,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=251, PETRI_TRANSITIONS=248} [2024-10-11 17:17:37,939 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-11 17:17:37,940 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 248 transitions, 516 flow [2024-10-11 17:17:37,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:37,941 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] [2024-10-11 17:17:37,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:17:37,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:37,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:37,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1315042951, now seen corresponding path program 1 times [2024-10-11 17:17:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:37,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464023128] [2024-10-11 17:17:37,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:37,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-10-11 17:17:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464023128] [2024-10-11 17:17:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464023128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:37,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:37,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952524608] [2024-10-11 17:17:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:37,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:37,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:37,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-11 17:17:37,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 248 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:37,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-11 17:17:37,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:38,060 INFO L124 PetriNetUnfolderBase]: 31/493 cut-off events. [2024-10-11 17:17:38,061 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:17:38,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 493 events. 31/493 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1565 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 508. Up to 63 conditions per place. [2024-10-11 17:17:38,063 INFO L140 encePairwiseOnDemand]: 324/326 looper letters, 12 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2024-10-11 17:17:38,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 247 transitions, 540 flow [2024-10-11 17:17:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-10-11 17:17:38,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8220858895705522 [2024-10-11 17:17:38,066 INFO L175 Difference]: Start difference. First operand has 251 places, 248 transitions, 516 flow. Second operand 3 states and 804 transitions. [2024-10-11 17:17:38,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 247 transitions, 540 flow [2024-10-11 17:17:38,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 247 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:38,071 INFO L231 Difference]: Finished difference. Result has 250 places, 247 transitions, 512 flow [2024-10-11 17:17:38,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=250, PETRI_TRANSITIONS=247} [2024-10-11 17:17:38,073 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -52 predicate places. [2024-10-11 17:17:38,076 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 247 transitions, 512 flow [2024-10-11 17:17:38,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:38,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:38,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:17:38,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:38,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1481040239, now seen corresponding path program 1 times [2024-10-11 17:17:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:38,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691313797] [2024-10-11 17:17:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:38,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:38,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691313797] [2024-10-11 17:17:38,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691313797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:38,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:38,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734873016] [2024-10-11 17:17:38,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:38,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:38,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:38,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:38,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 326 [2024-10-11 17:17:38,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 247 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:38,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:38,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 326 [2024-10-11 17:17:38,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:38,936 INFO L124 PetriNetUnfolderBase]: 31/491 cut-off events. [2024-10-11 17:17:38,936 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:17:38,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 491 events. 31/491 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1572 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 529. Up to 78 conditions per place. [2024-10-11 17:17:38,940 INFO L140 encePairwiseOnDemand]: 314/326 looper letters, 26 selfloop transitions, 10 changer transitions 0/245 dead transitions. [2024-10-11 17:17:38,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 245 transitions, 580 flow [2024-10-11 17:17:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1476 transitions. [2024-10-11 17:17:38,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.754601226993865 [2024-10-11 17:17:38,944 INFO L175 Difference]: Start difference. First operand has 250 places, 247 transitions, 512 flow. Second operand 6 states and 1476 transitions. [2024-10-11 17:17:38,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 245 transitions, 580 flow [2024-10-11 17:17:38,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 245 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:38,949 INFO L231 Difference]: Finished difference. Result has 252 places, 245 transitions, 527 flow [2024-10-11 17:17:38,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=252, PETRI_TRANSITIONS=245} [2024-10-11 17:17:38,950 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-11 17:17:38,950 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 245 transitions, 527 flow [2024-10-11 17:17:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:38,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:38,952 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] [2024-10-11 17:17:38,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:17:38,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 635319152, now seen corresponding path program 1 times [2024-10-11 17:17:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210205735] [2024-10-11 17:17:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:38,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:38,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210205735] [2024-10-11 17:17:38,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210205735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:38,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:38,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957756652] [2024-10-11 17:17:38,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:38,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:38,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:38,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-11 17:17:38,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 245 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:38,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:38,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-11 17:17:38,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:39,088 INFO L124 PetriNetUnfolderBase]: 31/490 cut-off events. [2024-10-11 17:17:39,088 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:17:39,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 490 events. 31/490 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1557 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 566. Up to 65 conditions per place. [2024-10-11 17:17:39,091 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-10-11 17:17:39,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 555 flow [2024-10-11 17:17:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-11 17:17:39,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-11 17:17:39,094 INFO L175 Difference]: Start difference. First operand has 252 places, 245 transitions, 527 flow. Second operand 3 states and 797 transitions. [2024-10-11 17:17:39,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 555 flow [2024-10-11 17:17:39,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 535 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:39,099 INFO L231 Difference]: Finished difference. Result has 248 places, 244 transitions, 509 flow [2024-10-11 17:17:39,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=248, PETRI_TRANSITIONS=244} [2024-10-11 17:17:39,100 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -54 predicate places. [2024-10-11 17:17:39,100 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 244 transitions, 509 flow [2024-10-11 17:17:39,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:39,101 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] [2024-10-11 17:17:39,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:17:39,101 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash -566549835, now seen corresponding path program 1 times [2024-10-11 17:17:39,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:39,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458374222] [2024-10-11 17:17:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:39,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:39,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458374222] [2024-10-11 17:17:39,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458374222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:39,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887892915] [2024-10-11 17:17:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:39,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:39,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-11 17:17:39,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 244 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:39,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-11 17:17:39,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:39,216 INFO L124 PetriNetUnfolderBase]: 31/489 cut-off events. [2024-10-11 17:17:39,216 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:17:39,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 489 events. 31/489 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1525 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 505. Up to 63 conditions per place. [2024-10-11 17:17:39,219 INFO L140 encePairwiseOnDemand]: 324/326 looper letters, 12 selfloop transitions, 1 changer transitions 0/243 dead transitions. [2024-10-11 17:17:39,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 243 transitions, 533 flow [2024-10-11 17:17:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-10-11 17:17:39,222 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8220858895705522 [2024-10-11 17:17:39,222 INFO L175 Difference]: Start difference. First operand has 248 places, 244 transitions, 509 flow. Second operand 3 states and 804 transitions. [2024-10-11 17:17:39,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 243 transitions, 533 flow [2024-10-11 17:17:39,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:39,227 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 505 flow [2024-10-11 17:17:39,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2024-10-11 17:17:39,228 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -55 predicate places. [2024-10-11 17:17:39,228 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 505 flow [2024-10-11 17:17:39,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:39,229 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:39,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:17:39,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:39,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1422886651, now seen corresponding path program 1 times [2024-10-11 17:17:39,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090102557] [2024-10-11 17:17:39,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090102557] [2024-10-11 17:17:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090102557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:39,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:39,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512299991] [2024-10-11 17:17:39,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:39,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-11 17:17:39,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:39,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-11 17:17:39,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:39,350 INFO L124 PetriNetUnfolderBase]: 31/488 cut-off events. [2024-10-11 17:17:39,350 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:17:39,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 488 events. 31/488 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1521 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 505. Up to 65 conditions per place. [2024-10-11 17:17:39,353 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-10-11 17:17:39,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 533 flow [2024-10-11 17:17:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-11 17:17:39,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-11 17:17:39,356 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 505 flow. Second operand 3 states and 797 transitions. [2024-10-11 17:17:39,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 533 flow [2024-10-11 17:17:39,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 242 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:39,361 INFO L231 Difference]: Finished difference. Result has 247 places, 242 transitions, 506 flow [2024-10-11 17:17:39,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=247, PETRI_TRANSITIONS=242} [2024-10-11 17:17:39,362 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -55 predicate places. [2024-10-11 17:17:39,362 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 242 transitions, 506 flow [2024-10-11 17:17:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:39,363 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] [2024-10-11 17:17:39,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:17:39,363 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:39,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash -90226084, now seen corresponding path program 1 times [2024-10-11 17:17:39,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:39,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459402393] [2024-10-11 17:17:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459402393] [2024-10-11 17:17:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459402393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:39,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:39,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935856324] [2024-10-11 17:17:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:39,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 326 [2024-10-11 17:17:39,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 242 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:39,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 326 [2024-10-11 17:17:39,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:39,529 INFO L124 PetriNetUnfolderBase]: 66/502 cut-off events. [2024-10-11 17:17:39,529 INFO L125 PetriNetUnfolderBase]: For 32/40 co-relation queries the response was YES. [2024-10-11 17:17:39,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 502 events. 66/502 cut-off events. For 32/40 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1679 event pairs, 8 based on Foata normal form. 2/451 useless extension candidates. Maximal degree in co-relation 616. Up to 108 conditions per place. [2024-10-11 17:17:39,533 INFO L140 encePairwiseOnDemand]: 319/326 looper letters, 16 selfloop transitions, 5 changer transitions 0/243 dead transitions. [2024-10-11 17:17:39,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 555 flow [2024-10-11 17:17:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-11 17:17:39,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-11 17:17:39,536 INFO L175 Difference]: Start difference. First operand has 247 places, 242 transitions, 506 flow. Second operand 3 states and 795 transitions. [2024-10-11 17:17:39,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 555 flow [2024-10-11 17:17:39,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 243 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:39,541 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 506 flow [2024-10-11 17:17:39,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2024-10-11 17:17:39,542 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -58 predicate places. [2024-10-11 17:17:39,543 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 506 flow [2024-10-11 17:17:39,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:39,544 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] [2024-10-11 17:17:39,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:17:39,544 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:39,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash -807875329, now seen corresponding path program 1 times [2024-10-11 17:17:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286946953] [2024-10-11 17:17:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:39,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286946953] [2024-10-11 17:17:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286946953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:39,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250065339] [2024-10-11 17:17:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:39,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:39,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-11 17:17:39,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:39,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-11 17:17:39,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:39,728 INFO L124 PetriNetUnfolderBase]: 91/667 cut-off events. [2024-10-11 17:17:39,728 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-11 17:17:39,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 667 events. 91/667 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2738 event pairs, 56 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 848. Up to 179 conditions per place. [2024-10-11 17:17:39,732 INFO L140 encePairwiseOnDemand]: 322/326 looper letters, 16 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-10-11 17:17:39,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 240 transitions, 545 flow [2024-10-11 17:17:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-10-11 17:17:39,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8190184049079755 [2024-10-11 17:17:39,736 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 506 flow. Second operand 3 states and 801 transitions. [2024-10-11 17:17:39,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 240 transitions, 545 flow [2024-10-11 17:17:39,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 240 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:39,741 INFO L231 Difference]: Finished difference. Result has 243 places, 239 transitions, 506 flow [2024-10-11 17:17:39,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=243, PETRI_TRANSITIONS=239} [2024-10-11 17:17:39,742 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -59 predicate places. [2024-10-11 17:17:39,743 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 239 transitions, 506 flow [2024-10-11 17:17:39,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:39,744 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] [2024-10-11 17:17:39,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:17:39,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:39,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1859511202, now seen corresponding path program 1 times [2024-10-11 17:17:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:39,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411180862] [2024-10-11 17:17:39,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411180862] [2024-10-11 17:17:39,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411180862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:39,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:39,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837222103] [2024-10-11 17:17:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:39,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 326 [2024-10-11 17:17:39,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:39,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 326 [2024-10-11 17:17:39,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:39,932 INFO L124 PetriNetUnfolderBase]: 81/569 cut-off events. [2024-10-11 17:17:39,933 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-10-11 17:17:39,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 569 events. 81/569 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2105 event pairs, 16 based on Foata normal form. 4/528 useless extension candidates. Maximal degree in co-relation 726. Up to 113 conditions per place. [2024-10-11 17:17:39,936 INFO L140 encePairwiseOnDemand]: 319/326 looper letters, 13 selfloop transitions, 5 changer transitions 4/240 dead transitions. [2024-10-11 17:17:39,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 240 transitions, 553 flow [2024-10-11 17:17:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 794 transitions. [2024-10-11 17:17:39,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8118609406952966 [2024-10-11 17:17:39,939 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 506 flow. Second operand 3 states and 794 transitions. [2024-10-11 17:17:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 240 transitions, 553 flow [2024-10-11 17:17:39,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 240 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:39,944 INFO L231 Difference]: Finished difference. Result has 242 places, 232 transitions, 501 flow [2024-10-11 17:17:39,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=242, PETRI_TRANSITIONS=232} [2024-10-11 17:17:39,945 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -60 predicate places. [2024-10-11 17:17:39,945 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 232 transitions, 501 flow [2024-10-11 17:17:39,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:39,946 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] [2024-10-11 17:17:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:17:39,947 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:39,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -596019474, now seen corresponding path program 1 times [2024-10-11 17:17:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:39,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557763949] [2024-10-11 17:17:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557763949] [2024-10-11 17:17:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557763949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:40,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:40,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037487086] [2024-10-11 17:17:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:40,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:40,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:40,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-11 17:17:40,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 232 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:40,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:40,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-11 17:17:40,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:40,164 INFO L124 PetriNetUnfolderBase]: 74/624 cut-off events. [2024-10-11 17:17:40,164 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-10-11 17:17:40,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 624 events. 74/624 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2428 event pairs, 41 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 835. Up to 116 conditions per place. [2024-10-11 17:17:40,168 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 17 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-10-11 17:17:40,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 235 transitions, 554 flow [2024-10-11 17:17:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-11 17:17:40,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-11 17:17:40,171 INFO L175 Difference]: Start difference. First operand has 242 places, 232 transitions, 501 flow. Second operand 3 states and 797 transitions. [2024-10-11 17:17:40,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 235 transitions, 554 flow [2024-10-11 17:17:40,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 235 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:40,176 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 493 flow [2024-10-11 17:17:40,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2024-10-11 17:17:40,177 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -65 predicate places. [2024-10-11 17:17:40,177 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 493 flow [2024-10-11 17:17:40,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:40,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:40,178 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:40,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:17:40,178 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-11 17:17:40,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1268848396, now seen corresponding path program 1 times [2024-10-11 17:17:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911214476] [2024-10-11 17:17:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911214476] [2024-10-11 17:17:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911214476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901826870] [2024-10-11 17:17:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:40,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-11 17:17:40,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 231 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:40,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:40,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-11 17:17:40,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:40,333 INFO L124 PetriNetUnfolderBase]: 81/538 cut-off events. [2024-10-11 17:17:40,333 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-10-11 17:17:40,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 538 events. 81/538 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1975 event pairs, 48 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 692. Up to 129 conditions per place. [2024-10-11 17:17:40,336 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 0 selfloop transitions, 0 changer transitions 234/234 dead transitions. [2024-10-11 17:17:40,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 234 transitions, 542 flow [2024-10-11 17:17:40,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-11 17:17:40,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-11 17:17:40,339 INFO L175 Difference]: Start difference. First operand has 237 places, 231 transitions, 493 flow. Second operand 3 states and 797 transitions. [2024-10-11 17:17:40,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 234 transitions, 542 flow [2024-10-11 17:17:40,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 234 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:40,342 INFO L231 Difference]: Finished difference. Result has 236 places, 0 transitions, 0 flow [2024-10-11 17:17:40,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=236, PETRI_TRANSITIONS=0} [2024-10-11 17:17:40,343 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -66 predicate places. [2024-10-11 17:17:40,343 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 0 transitions, 0 flow [2024-10-11 17:17:40,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:40,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (114 of 115 remaining) [2024-10-11 17:17:40,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (113 of 115 remaining) [2024-10-11 17:17:40,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (112 of 115 remaining) [2024-10-11 17:17:40,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (111 of 115 remaining) [2024-10-11 17:17:40,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (110 of 115 remaining) [2024-10-11 17:17:40,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (109 of 115 remaining) [2024-10-11 17:17:40,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (108 of 115 remaining) [2024-10-11 17:17:40,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (107 of 115 remaining) [2024-10-11 17:17:40,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (106 of 115 remaining) [2024-10-11 17:17:40,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (105 of 115 remaining) [2024-10-11 17:17:40,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (104 of 115 remaining) [2024-10-11 17:17:40,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (103 of 115 remaining) [2024-10-11 17:17:40,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (102 of 115 remaining) [2024-10-11 17:17:40,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (101 of 115 remaining) [2024-10-11 17:17:40,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (100 of 115 remaining) [2024-10-11 17:17:40,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (99 of 115 remaining) [2024-10-11 17:17:40,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (98 of 115 remaining) [2024-10-11 17:17:40,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (97 of 115 remaining) [2024-10-11 17:17:40,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (96 of 115 remaining) [2024-10-11 17:17:40,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (95 of 115 remaining) [2024-10-11 17:17:40,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (94 of 115 remaining) [2024-10-11 17:17:40,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (93 of 115 remaining) [2024-10-11 17:17:40,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (92 of 115 remaining) [2024-10-11 17:17:40,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (91 of 115 remaining) [2024-10-11 17:17:40,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 115 remaining) [2024-10-11 17:17:40,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 115 remaining) [2024-10-11 17:17:40,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 115 remaining) [2024-10-11 17:17:40,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 115 remaining) [2024-10-11 17:17:40,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 115 remaining) [2024-10-11 17:17:40,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 115 remaining) [2024-10-11 17:17:40,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 115 remaining) [2024-10-11 17:17:40,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 115 remaining) [2024-10-11 17:17:40,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 115 remaining) [2024-10-11 17:17:40,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 115 remaining) [2024-10-11 17:17:40,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 115 remaining) [2024-10-11 17:17:40,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 115 remaining) [2024-10-11 17:17:40,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 115 remaining) [2024-10-11 17:17:40,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (76 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (75 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (74 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (72 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (71 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (70 of 115 remaining) [2024-10-11 17:17:40,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 115 remaining) [2024-10-11 17:17:40,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 115 remaining) [2024-10-11 17:17:40,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (67 of 115 remaining) [2024-10-11 17:17:40,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (66 of 115 remaining) [2024-10-11 17:17:40,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (65 of 115 remaining) [2024-10-11 17:17:40,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (64 of 115 remaining) [2024-10-11 17:17:40,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 115 remaining) [2024-10-11 17:17:40,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (62 of 115 remaining) [2024-10-11 17:17:40,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (61 of 115 remaining) [2024-10-11 17:17:40,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (60 of 115 remaining) [2024-10-11 17:17:40,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (59 of 115 remaining) [2024-10-11 17:17:40,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 115 remaining) [2024-10-11 17:17:40,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (57 of 115 remaining) [2024-10-11 17:17:40,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (56 of 115 remaining) [2024-10-11 17:17:40,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (55 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (54 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (52 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (51 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (50 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 115 remaining) [2024-10-11 17:17:40,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 115 remaining) [2024-10-11 17:17:40,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (28 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (27 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (26 of 115 remaining) [2024-10-11 17:17:40,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (25 of 115 remaining) [2024-10-11 17:17:40,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (24 of 115 remaining) [2024-10-11 17:17:40,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 115 remaining) [2024-10-11 17:17:40,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 115 remaining) [2024-10-11 17:17:40,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 115 remaining) [2024-10-11 17:17:40,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 115 remaining) [2024-10-11 17:17:40,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 115 remaining) [2024-10-11 17:17:40,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 115 remaining) [2024-10-11 17:17:40,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 115 remaining) [2024-10-11 17:17:40,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 115 remaining) [2024-10-11 17:17:40,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 115 remaining) [2024-10-11 17:17:40,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 115 remaining) [2024-10-11 17:17:40,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 115 remaining) [2024-10-11 17:17:40,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 115 remaining) [2024-10-11 17:17:40,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (11 of 115 remaining) [2024-10-11 17:17:40,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 115 remaining) [2024-10-11 17:17:40,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (9 of 115 remaining) [2024-10-11 17:17:40,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 115 remaining) [2024-10-11 17:17:40,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (7 of 115 remaining) [2024-10-11 17:17:40,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (6 of 115 remaining) [2024-10-11 17:17:40,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (5 of 115 remaining) [2024-10-11 17:17:40,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (4 of 115 remaining) [2024-10-11 17:17:40,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (3 of 115 remaining) [2024-10-11 17:17:40,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 115 remaining) [2024-10-11 17:17:40,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 115 remaining) [2024-10-11 17:17:40,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 115 remaining) [2024-10-11 17:17:40,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:17:40,362 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] [2024-10-11 17:17:40,367 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:17:40,368 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:17:40,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:17:40 BasicIcfg [2024-10-11 17:17:40,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:17:40,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:17:40,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:17:40,375 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:17:40,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:35" (3/4) ... [2024-10-11 17:17:40,377 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:17:40,379 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:17:40,380 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:17:40,386 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 17:17:40,387 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:17:40,387 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:17:40,388 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:17:40,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:17:40,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:17:40,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:17:40,492 INFO L158 Benchmark]: Toolchain (without parser) took 6740.27ms. Allocated memory was 186.6MB in the beginning and 327.2MB in the end (delta: 140.5MB). Free memory was 118.9MB in the beginning and 122.1MB in the end (delta: -3.2MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:40,492 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:17:40,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.02ms. Allocated memory is still 186.6MB. Free memory was 118.7MB in the beginning and 104.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:17:40,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.36ms. Allocated memory is still 186.6MB. Free memory was 104.3MB in the beginning and 101.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:17:40,493 INFO L158 Benchmark]: Boogie Preprocessor took 66.87ms. Allocated memory is still 186.6MB. Free memory was 101.0MB in the beginning and 98.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:40,493 INFO L158 Benchmark]: RCFGBuilder took 1382.53ms. Allocated memory is still 186.6MB. Free memory was 98.3MB in the beginning and 148.4MB in the end (delta: -50.1MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2024-10-11 17:17:40,493 INFO L158 Benchmark]: TraceAbstraction took 4746.09ms. Allocated memory was 186.6MB in the beginning and 327.2MB in the end (delta: 140.5MB). Free memory was 148.4MB in the beginning and 128.3MB in the end (delta: 20.1MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. [2024-10-11 17:17:40,493 INFO L158 Benchmark]: Witness Printer took 117.02ms. Allocated memory is still 327.2MB. Free memory was 128.3MB in the beginning and 122.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:40,496 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.15ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.02ms. Allocated memory is still 186.6MB. Free memory was 118.7MB in the beginning and 104.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.36ms. Allocated memory is still 186.6MB. Free memory was 104.3MB in the beginning and 101.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.87ms. Allocated memory is still 186.6MB. Free memory was 101.0MB in the beginning and 98.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1382.53ms. Allocated memory is still 186.6MB. Free memory was 98.3MB in the beginning and 148.4MB in the end (delta: -50.1MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4746.09ms. Allocated memory was 186.6MB in the beginning and 327.2MB in the end (delta: 140.5MB). Free memory was 148.4MB in the beginning and 128.3MB in the end (delta: 20.1MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. * Witness Printer took 117.02ms. Allocated memory is still 327.2MB. Free memory was 128.3MB in the beginning and 122.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 404 locations, 115 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: 4.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 69 mSDtfsCounter, 622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred in iteration=0, InterpolantAutomatonStates: 60, 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.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 1943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 65 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:17:40,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE