./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:39:55,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:39:55,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:39:55,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:39:55,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:39:55,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:39:55,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:39:55,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:39:55,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:39:55,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:39:55,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:39:55,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:39:55,584 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:39:55,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:39:55,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:39:55,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:39:55,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:39:55,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:39:55,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:39:55,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:39:55,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:39:55,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:39:55,592 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:39:55,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:39:55,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:39:55,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:39:55,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:39:55,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:39:55,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:39:55,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:39:55,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:39:55,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:39:55,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:39:55,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:39:55,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:39:55,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:39:55,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:39:55,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:39:55,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:39:55,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:39:55,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:39:55,599 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2024-11-12 12:39:55,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:39:55,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:39:55,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:39:55,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:39:55,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:39:55,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2024-11-12 12:39:57,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:39:57,558 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:39:57,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2024-11-12 12:39:57,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3802afe11/7ad917c95c7640ed99fe6910ff1e1935/FLAGf35976468 [2024-11-12 12:39:57,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3802afe11/7ad917c95c7640ed99fe6910ff1e1935 [2024-11-12 12:39:57,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:39:57,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:39:57,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:39:57,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:39:57,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:39:57,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:39:57" (1/1) ... [2024-11-12 12:39:57,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2fc1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:57, skipping insertion in model container [2024-11-12 12:39:57,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:39:57" (1/1) ... [2024-11-12 12:39:57,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:39:58,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:39:58,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:39:58,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:39:58,257 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:39:58,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58 WrapperNode [2024-11-12 12:39:58,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:39:58,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:39:58,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:39:58,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:39:58,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,328 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 533 [2024-11-12 12:39:58,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:39:58,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:39:58,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:39:58,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:39:58,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:39:58,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:39:58,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:39:58,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:39:58,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:39:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:39:58,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:39:58,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:39:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:39:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:39:58,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:39:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:39:58,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:39:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 12:39:58,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 12:39:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:39:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:39:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 12:39:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 12:39:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:39:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:39:58,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:39:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:39:58,501 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:39:58,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:39:58,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:39:59,434 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:39:59,435 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:39:59,917 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:39:59,917 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 12:39:59,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:59 BoogieIcfgContainer [2024-11-12 12:39:59,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:39:59,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:39:59,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:39:59,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:39:59,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:39:57" (1/3) ... [2024-11-12 12:39:59,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a4b6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:39:59, skipping insertion in model container [2024-11-12 12:39:59,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (2/3) ... [2024-11-12 12:39:59,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a4b6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:39:59, skipping insertion in model container [2024-11-12 12:39:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:59" (3/3) ... [2024-11-12 12:39:59,966 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2024-11-12 12:39:59,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:39:59,986 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2024-11-12 12:39:59,986 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:40:00,121 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:40:00,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 449 transitions, 919 flow [2024-11-12 12:40:00,376 INFO L124 PetriNetUnfolderBase]: 20/446 cut-off events. [2024-11-12 12:40:00,376 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:40:00,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 446 events. 20/446 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 840 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 353. Up to 3 conditions per place. [2024-11-12 12:40:00,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 439 places, 449 transitions, 919 flow [2024-11-12 12:40:00,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 417 places, 425 transitions, 868 flow [2024-11-12 12:40:00,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:40:00,425 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;@2f86e8fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:40:00,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2024-11-12 12:40:00,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:40:00,433 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-11-12 12:40:00,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:40:00,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:00,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:00,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:00,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1923691324, now seen corresponding path program 1 times [2024-11-12 12:40:00,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:00,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359350272] [2024-11-12 12:40:00,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:00,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359350272] [2024-11-12 12:40:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359350272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:00,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:00,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892232192] [2024-11-12 12:40:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:00,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:00,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:00,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 449 [2024-11-12 12:40:00,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 425 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:00,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:00,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 449 [2024-11-12 12:40:00,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:01,116 INFO L124 PetriNetUnfolderBase]: 165/1467 cut-off events. [2024-11-12 12:40:01,116 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-12 12:40:01,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 1467 events. 165/1467 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9725 event pairs, 128 based on Foata normal form. 80/1293 useless extension candidates. Maximal degree in co-relation 1421. Up to 251 conditions per place. [2024-11-12 12:40:01,133 INFO L140 encePairwiseOnDemand]: 390/449 looper letters, 18 selfloop transitions, 2 changer transitions 5/368 dead transitions. [2024-11-12 12:40:01,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 368 transitions, 794 flow [2024-11-12 12:40:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2024-11-12 12:40:01,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8789903489235338 [2024-11-12 12:40:01,156 INFO L175 Difference]: Start difference. First operand has 417 places, 425 transitions, 868 flow. Second operand 3 states and 1184 transitions. [2024-11-12 12:40:01,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 368 transitions, 794 flow [2024-11-12 12:40:01,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 782 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-12 12:40:01,173 INFO L231 Difference]: Finished difference. Result has 368 places, 363 transitions, 736 flow [2024-11-12 12:40:01,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=368, PETRI_TRANSITIONS=363} [2024-11-12 12:40:01,179 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -49 predicate places. [2024-11-12 12:40:01,182 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 363 transitions, 736 flow [2024-11-12 12:40:01,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:01,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:01,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:01,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:01,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash 987668710, now seen corresponding path program 1 times [2024-11-12 12:40:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:01,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266636463] [2024-11-12 12:40:01,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:01,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-11-12 12:40:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266636463] [2024-11-12 12:40:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266636463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577025155] [2024-11-12 12:40:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:01,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:01,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:01,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 449 [2024-11-12 12:40:01,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 363 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:01,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:01,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 449 [2024-11-12 12:40:01,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:01,539 INFO L124 PetriNetUnfolderBase]: 86/1145 cut-off events. [2024-11-12 12:40:01,539 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-12 12:40:01,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 1145 events. 86/1145 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6193 event pairs, 51 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1260. Up to 131 conditions per place. [2024-11-12 12:40:01,549 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 17 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-12 12:40:01,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 362 transitions, 772 flow [2024-11-12 12:40:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2024-11-12 12:40:01,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389012620638456 [2024-11-12 12:40:01,552 INFO L175 Difference]: Start difference. First operand has 368 places, 363 transitions, 736 flow. Second operand 3 states and 1130 transitions. [2024-11-12 12:40:01,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 362 transitions, 772 flow [2024-11-12 12:40:01,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 362 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:01,560 INFO L231 Difference]: Finished difference. Result has 362 places, 362 transitions, 734 flow [2024-11-12 12:40:01,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=362, PETRI_TRANSITIONS=362} [2024-11-12 12:40:01,563 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -55 predicate places. [2024-11-12 12:40:01,563 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 362 transitions, 734 flow [2024-11-12 12:40:01,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:01,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:01,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:01,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:01,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:01,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1309891628, now seen corresponding path program 1 times [2024-11-12 12:40:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:01,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994066351] [2024-11-12 12:40:01,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994066351] [2024-11-12 12:40:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994066351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:01,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:01,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:01,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104628702] [2024-11-12 12:40:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:01,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:01,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:01,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:01,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:01,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 449 [2024-11-12 12:40:01,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 362 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:01,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:01,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 449 [2024-11-12 12:40:01,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:01,819 INFO L124 PetriNetUnfolderBase]: 59/875 cut-off events. [2024-11-12 12:40:01,819 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-12 12:40:01,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 875 events. 59/875 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4229 event pairs, 38 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 937. Up to 90 conditions per place. [2024-11-12 12:40:01,829 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 15 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-12 12:40:01,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 361 transitions, 766 flow [2024-11-12 12:40:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2024-11-12 12:40:01,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418708240534521 [2024-11-12 12:40:01,833 INFO L175 Difference]: Start difference. First operand has 362 places, 362 transitions, 734 flow. Second operand 3 states and 1134 transitions. [2024-11-12 12:40:01,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 361 transitions, 766 flow [2024-11-12 12:40:01,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 361 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:01,839 INFO L231 Difference]: Finished difference. Result has 361 places, 361 transitions, 732 flow [2024-11-12 12:40:01,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=361, PETRI_TRANSITIONS=361} [2024-11-12 12:40:01,841 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -56 predicate places. [2024-11-12 12:40:01,842 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 361 transitions, 732 flow [2024-11-12 12:40:01,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:01,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:01,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:01,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:01,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:01,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1973999239, now seen corresponding path program 1 times [2024-11-12 12:40:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244989292] [2024-11-12 12:40:01,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:01,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244989292] [2024-11-12 12:40:01,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244989292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:01,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:01,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102686603] [2024-11-12 12:40:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:01,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:01,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:01,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 449 [2024-11-12 12:40:01,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 361 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:01,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:01,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 449 [2024-11-12 12:40:01,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,088 INFO L124 PetriNetUnfolderBase]: 59/874 cut-off events. [2024-11-12 12:40:02,089 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-12 12:40:02,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 874 events. 59/874 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4197 event pairs, 38 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 928. Up to 90 conditions per place. [2024-11-12 12:40:02,098 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 15 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-12 12:40:02,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 360 transitions, 764 flow [2024-11-12 12:40:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2024-11-12 12:40:02,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418708240534521 [2024-11-12 12:40:02,101 INFO L175 Difference]: Start difference. First operand has 361 places, 361 transitions, 732 flow. Second operand 3 states and 1134 transitions. [2024-11-12 12:40:02,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 360 transitions, 764 flow [2024-11-12 12:40:02,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 360 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:02,108 INFO L231 Difference]: Finished difference. Result has 360 places, 360 transitions, 730 flow [2024-11-12 12:40:02,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=360, PETRI_TRANSITIONS=360} [2024-11-12 12:40:02,110 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -57 predicate places. [2024-11-12 12:40:02,110 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 360 transitions, 730 flow [2024-11-12 12:40:02,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,112 INFO L206 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] [2024-11-12 12:40:02,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:02,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:02,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1151880117, now seen corresponding path program 1 times [2024-11-12 12:40:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232778198] [2024-11-12 12:40:02,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232778198] [2024-11-12 12:40:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232778198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782396135] [2024-11-12 12:40:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 449 [2024-11-12 12:40:02,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 360 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 449 [2024-11-12 12:40:02,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,320 INFO L124 PetriNetUnfolderBase]: 59/873 cut-off events. [2024-11-12 12:40:02,321 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-12 12:40:02,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 873 events. 59/873 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4224 event pairs, 38 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 919. Up to 90 conditions per place. [2024-11-12 12:40:02,329 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 15 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-12 12:40:02,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 359 transitions, 762 flow [2024-11-12 12:40:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2024-11-12 12:40:02,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418708240534521 [2024-11-12 12:40:02,333 INFO L175 Difference]: Start difference. First operand has 360 places, 360 transitions, 730 flow. Second operand 3 states and 1134 transitions. [2024-11-12 12:40:02,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 359 transitions, 762 flow [2024-11-12 12:40:02,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:02,339 INFO L231 Difference]: Finished difference. Result has 359 places, 359 transitions, 728 flow [2024-11-12 12:40:02,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=359, PETRI_TRANSITIONS=359} [2024-11-12 12:40:02,342 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -58 predicate places. [2024-11-12 12:40:02,342 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 359 transitions, 728 flow [2024-11-12 12:40:02,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,344 INFO L206 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] [2024-11-12 12:40:02,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:02,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:02,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 659892180, now seen corresponding path program 1 times [2024-11-12 12:40:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554700382] [2024-11-12 12:40:02,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554700382] [2024-11-12 12:40:02,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554700382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874416135] [2024-11-12 12:40:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 449 [2024-11-12 12:40:02,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 359 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 449 [2024-11-12 12:40:02,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,604 INFO L124 PetriNetUnfolderBase]: 56/796 cut-off events. [2024-11-12 12:40:02,605 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-12 12:40:02,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 796 events. 56/796 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3427 event pairs, 7 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 834. Up to 69 conditions per place. [2024-11-12 12:40:02,613 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 18 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-12 12:40:02,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 364 transitions, 780 flow [2024-11-12 12:40:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2024-11-12 12:40:02,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530066815144766 [2024-11-12 12:40:02,618 INFO L175 Difference]: Start difference. First operand has 359 places, 359 transitions, 728 flow. Second operand 3 states and 1149 transitions. [2024-11-12 12:40:02,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 364 transitions, 780 flow [2024-11-12 12:40:02,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 364 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:02,626 INFO L231 Difference]: Finished difference. Result has 359 places, 359 transitions, 732 flow [2024-11-12 12:40:02,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=359, PETRI_TRANSITIONS=359} [2024-11-12 12:40:02,628 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -58 predicate places. [2024-11-12 12:40:02,628 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 359 transitions, 732 flow [2024-11-12 12:40:02,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,629 INFO L206 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] [2024-11-12 12:40:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:02,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:02,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1466747859, now seen corresponding path program 1 times [2024-11-12 12:40:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101848741] [2024-11-12 12:40:02,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101848741] [2024-11-12 12:40:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101848741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722859968] [2024-11-12 12:40:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:02,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 359 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:02,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,867 INFO L124 PetriNetUnfolderBase]: 59/877 cut-off events. [2024-11-12 12:40:02,867 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-11-12 12:40:02,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 877 events. 59/877 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4309 event pairs, 38 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 385. Up to 92 conditions per place. [2024-11-12 12:40:02,877 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 15 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-12 12:40:02,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 358 transitions, 764 flow [2024-11-12 12:40:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:40:02,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433556050482554 [2024-11-12 12:40:02,880 INFO L175 Difference]: Start difference. First operand has 359 places, 359 transitions, 732 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:40:02,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 358 transitions, 764 flow [2024-11-12 12:40:02,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 358 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:02,887 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 732 flow [2024-11-12 12:40:02,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-11-12 12:40:02,888 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -58 predicate places. [2024-11-12 12:40:02,888 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 732 flow [2024-11-12 12:40:02,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,890 INFO L206 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] [2024-11-12 12:40:02,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:02,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:02,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash 190119616, now seen corresponding path program 1 times [2024-11-12 12:40:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437134759] [2024-11-12 12:40:02,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:02,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437134759] [2024-11-12 12:40:02,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437134759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697377180] [2024-11-12 12:40:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 449 [2024-11-12 12:40:02,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:02,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 449 [2024-11-12 12:40:02,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:03,113 INFO L124 PetriNetUnfolderBase]: 59/876 cut-off events. [2024-11-12 12:40:03,114 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2024-11-12 12:40:03,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 876 events. 59/876 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4306 event pairs, 38 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 932. Up to 93 conditions per place. [2024-11-12 12:40:03,120 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 16 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-12 12:40:03,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 357 transitions, 766 flow [2024-11-12 12:40:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2024-11-12 12:40:03,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418708240534521 [2024-11-12 12:40:03,123 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 732 flow. Second operand 3 states and 1134 transitions. [2024-11-12 12:40:03,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 357 transitions, 766 flow [2024-11-12 12:40:03,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:03,129 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 730 flow [2024-11-12 12:40:03,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2024-11-12 12:40:03,130 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2024-11-12 12:40:03,131 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 730 flow [2024-11-12 12:40:03,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:03,132 INFO L206 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] [2024-11-12 12:40:03,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:03,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:03,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1235829180, now seen corresponding path program 1 times [2024-11-12 12:40:03,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:03,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506993015] [2024-11-12 12:40:03,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506993015] [2024-11-12 12:40:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506993015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:03,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164493939] [2024-11-12 12:40:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:03,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:03,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:03,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 449 [2024-11-12 12:40:03,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:03,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 449 [2024-11-12 12:40:03,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:03,354 INFO L124 PetriNetUnfolderBase]: 66/972 cut-off events. [2024-11-12 12:40:03,354 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-12 12:40:03,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 972 events. 66/972 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4890 event pairs, 20 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 1030. Up to 54 conditions per place. [2024-11-12 12:40:03,364 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 21 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-12 12:40:03,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 364 transitions, 796 flow [2024-11-12 12:40:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2024-11-12 12:40:03,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8537490720118782 [2024-11-12 12:40:03,368 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 730 flow. Second operand 3 states and 1150 transitions. [2024-11-12 12:40:03,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 364 transitions, 796 flow [2024-11-12 12:40:03,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:03,374 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 734 flow [2024-11-12 12:40:03,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2024-11-12 12:40:03,375 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2024-11-12 12:40:03,376 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 734 flow [2024-11-12 12:40:03,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:03,377 INFO L206 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] [2024-11-12 12:40:03,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:03,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:03,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash -297019749, now seen corresponding path program 1 times [2024-11-12 12:40:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410137486] [2024-11-12 12:40:03,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:03,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410137486] [2024-11-12 12:40:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410137486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:03,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167067447] [2024-11-12 12:40:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:03,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:03,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:03,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:03,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:03,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:03,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:03,566 INFO L124 PetriNetUnfolderBase]: 66/893 cut-off events. [2024-11-12 12:40:03,566 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-12 12:40:03,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 893 events. 66/893 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4386 event pairs, 38 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 589. Up to 105 conditions per place. [2024-11-12 12:40:03,575 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 16 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-12 12:40:03,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 356 transitions, 768 flow [2024-11-12 12:40:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:40:03,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433556050482554 [2024-11-12 12:40:03,578 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 734 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:40:03,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 356 transitions, 768 flow [2024-11-12 12:40:03,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 766 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:03,584 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 734 flow [2024-11-12 12:40:03,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2024-11-12 12:40:03,585 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2024-11-12 12:40:03,586 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 734 flow [2024-11-12 12:40:03,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:03,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:03,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:03,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:03,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -881236344, now seen corresponding path program 1 times [2024-11-12 12:40:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:03,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699269688] [2024-11-12 12:40:03,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:03,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:03,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699269688] [2024-11-12 12:40:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699269688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:03,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380519415] [2024-11-12 12:40:03,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:03,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:03,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:03,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:03,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 449 [2024-11-12 12:40:03,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:03,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 449 [2024-11-12 12:40:03,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:03,801 INFO L124 PetriNetUnfolderBase]: 66/892 cut-off events. [2024-11-12 12:40:03,801 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-12 12:40:03,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 892 events. 66/892 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4389 event pairs, 38 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 969. Up to 103 conditions per place. [2024-11-12 12:40:03,809 INFO L140 encePairwiseOnDemand]: 447/449 looper letters, 15 selfloop transitions, 1 changer transitions 0/355 dead transitions. [2024-11-12 12:40:03,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 764 flow [2024-11-12 12:40:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2024-11-12 12:40:03,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8485523385300668 [2024-11-12 12:40:03,812 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 734 flow. Second operand 3 states and 1143 transitions. [2024-11-12 12:40:03,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 764 flow [2024-11-12 12:40:03,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:03,818 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2024-11-12 12:40:03,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2024-11-12 12:40:03,819 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -60 predicate places. [2024-11-12 12:40:03,819 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2024-11-12 12:40:03,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:03,820 INFO L206 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] [2024-11-12 12:40:03,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:40:03,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:03,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 597541853, now seen corresponding path program 1 times [2024-11-12 12:40:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579105971] [2024-11-12 12:40:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:03,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579105971] [2024-11-12 12:40:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579105971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:03,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:03,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667169866] [2024-11-12 12:40:03,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:03,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:03,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:03,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:03,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:03,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:03,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:03,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:03,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:04,038 INFO L124 PetriNetUnfolderBase]: 66/891 cut-off events. [2024-11-12 12:40:04,039 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-12 12:40:04,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 891 events. 66/891 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4408 event pairs, 38 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 969. Up to 105 conditions per place. [2024-11-12 12:40:04,047 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 16 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2024-11-12 12:40:04,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 354 transitions, 764 flow [2024-11-12 12:40:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:40:04,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433556050482554 [2024-11-12 12:40:04,050 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:40:04,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 354 transitions, 764 flow [2024-11-12 12:40:04,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 354 transitions, 763 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:04,056 INFO L231 Difference]: Finished difference. Result has 357 places, 354 transitions, 731 flow [2024-11-12 12:40:04,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=357, PETRI_TRANSITIONS=354} [2024-11-12 12:40:04,058 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -60 predicate places. [2024-11-12 12:40:04,058 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 354 transitions, 731 flow [2024-11-12 12:40:04,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:04,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:04,060 INFO L206 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] [2024-11-12 12:40:04,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:40:04,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:04,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash -639874363, now seen corresponding path program 1 times [2024-11-12 12:40:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:04,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981780434] [2024-11-12 12:40:04,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:04,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981780434] [2024-11-12 12:40:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981780434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:04,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018879005] [2024-11-12 12:40:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:04,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:04,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:04,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:04,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:04,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 449 [2024-11-12 12:40:04,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 354 transitions, 731 flow. Second operand has 6 states, 6 states have (on average 353.5) internal successors, (2121), 6 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:04,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:04,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 449 [2024-11-12 12:40:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:04,857 INFO L124 PetriNetUnfolderBase]: 66/889 cut-off events. [2024-11-12 12:40:04,858 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-12 12:40:04,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 889 events. 66/889 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4400 event pairs, 38 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 991. Up to 118 conditions per place. [2024-11-12 12:40:04,866 INFO L140 encePairwiseOnDemand]: 437/449 looper letters, 29 selfloop transitions, 10 changer transitions 0/352 dead transitions. [2024-11-12 12:40:04,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 352 transitions, 805 flow [2024-11-12 12:40:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2024-11-12 12:40:04,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7984409799554566 [2024-11-12 12:40:04,872 INFO L175 Difference]: Start difference. First operand has 357 places, 354 transitions, 731 flow. Second operand 6 states and 2151 transitions. [2024-11-12 12:40:04,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 352 transitions, 805 flow [2024-11-12 12:40:04,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 352 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:04,879 INFO L231 Difference]: Finished difference. Result has 358 places, 352 transitions, 743 flow [2024-11-12 12:40:04,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=743, PETRI_PLACES=358, PETRI_TRANSITIONS=352} [2024-11-12 12:40:04,880 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2024-11-12 12:40:04,881 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 352 transitions, 743 flow [2024-11-12 12:40:04,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.5) internal successors, (2121), 6 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:04,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:04,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:04,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:04,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:04,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -666750534, now seen corresponding path program 1 times [2024-11-12 12:40:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082138505] [2024-11-12 12:40:04,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:04,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:04,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082138505] [2024-11-12 12:40:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082138505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:04,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795149622] [2024-11-12 12:40:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:04,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:04,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:04,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:04,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:04,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 449 [2024-11-12 12:40:04,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:04,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:04,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 449 [2024-11-12 12:40:04,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:05,088 INFO L124 PetriNetUnfolderBase]: 66/888 cut-off events. [2024-11-12 12:40:05,088 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-12 12:40:05,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 888 events. 66/888 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4406 event pairs, 38 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 1036. Up to 103 conditions per place. [2024-11-12 12:40:05,098 INFO L140 encePairwiseOnDemand]: 447/449 looper letters, 15 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2024-11-12 12:40:05,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 351 transitions, 773 flow [2024-11-12 12:40:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2024-11-12 12:40:05,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8485523385300668 [2024-11-12 12:40:05,101 INFO L175 Difference]: Start difference. First operand has 358 places, 352 transitions, 743 flow. Second operand 3 states and 1143 transitions. [2024-11-12 12:40:05,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 351 transitions, 773 flow [2024-11-12 12:40:05,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 351 transitions, 753 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:05,108 INFO L231 Difference]: Finished difference. Result has 354 places, 351 transitions, 723 flow [2024-11-12 12:40:05,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=354, PETRI_TRANSITIONS=351} [2024-11-12 12:40:05,109 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -63 predicate places. [2024-11-12 12:40:05,110 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 351 transitions, 723 flow [2024-11-12 12:40:05,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:05,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:05,111 INFO L206 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] [2024-11-12 12:40:05,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:40:05,111 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:05,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1277348424, now seen corresponding path program 1 times [2024-11-12 12:40:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044458804] [2024-11-12 12:40:05,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:05,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044458804] [2024-11-12 12:40:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044458804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371464544] [2024-11-12 12:40:05,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:05,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:05,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 351 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:05,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:05,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:05,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:05,340 INFO L124 PetriNetUnfolderBase]: 66/887 cut-off events. [2024-11-12 12:40:05,340 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-12 12:40:05,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 887 events. 66/887 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4420 event pairs, 38 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 966. Up to 105 conditions per place. [2024-11-12 12:40:05,348 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 16 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2024-11-12 12:40:05,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 350 transitions, 757 flow [2024-11-12 12:40:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:40:05,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433556050482554 [2024-11-12 12:40:05,353 INFO L175 Difference]: Start difference. First operand has 354 places, 351 transitions, 723 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:40:05,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 350 transitions, 757 flow [2024-11-12 12:40:05,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 350 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:05,359 INFO L231 Difference]: Finished difference. Result has 354 places, 350 transitions, 724 flow [2024-11-12 12:40:05,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=354, PETRI_TRANSITIONS=350} [2024-11-12 12:40:05,361 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -63 predicate places. [2024-11-12 12:40:05,361 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 350 transitions, 724 flow [2024-11-12 12:40:05,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:05,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:05,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:05,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:40:05,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:05,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1959199573, now seen corresponding path program 1 times [2024-11-12 12:40:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:05,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126812069] [2024-11-12 12:40:05,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126812069] [2024-11-12 12:40:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126812069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:05,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:05,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793894171] [2024-11-12 12:40:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:05,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:05,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 449 [2024-11-12 12:40:05,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 350 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:05,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:05,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 449 [2024-11-12 12:40:05,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:05,611 INFO L124 PetriNetUnfolderBase]: 113/1283 cut-off events. [2024-11-12 12:40:05,611 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2024-11-12 12:40:05,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1283 events. 113/1283 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7608 event pairs, 64 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 1462. Up to 171 conditions per place. [2024-11-12 12:40:05,625 INFO L140 encePairwiseOnDemand]: 445/449 looper letters, 17 selfloop transitions, 1 changer transitions 2/347 dead transitions. [2024-11-12 12:40:05,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 347 transitions, 756 flow [2024-11-12 12:40:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2024-11-12 12:40:05,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389012620638456 [2024-11-12 12:40:05,629 INFO L175 Difference]: Start difference. First operand has 354 places, 350 transitions, 724 flow. Second operand 3 states and 1130 transitions. [2024-11-12 12:40:05,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 347 transitions, 756 flow [2024-11-12 12:40:05,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 347 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:05,635 INFO L231 Difference]: Finished difference. Result has 351 places, 345 transitions, 712 flow [2024-11-12 12:40:05,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=351, PETRI_TRANSITIONS=345} [2024-11-12 12:40:05,636 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -66 predicate places. [2024-11-12 12:40:05,637 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 345 transitions, 712 flow [2024-11-12 12:40:05,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:05,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:05,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:05,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:40:05,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:05,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1153718697, now seen corresponding path program 1 times [2024-11-12 12:40:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334042780] [2024-11-12 12:40:05,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:05,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:05,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334042780] [2024-11-12 12:40:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334042780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131776617] [2024-11-12 12:40:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:05,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:05,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:05,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 449 [2024-11-12 12:40:05,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 345 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:05,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:05,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 449 [2024-11-12 12:40:05,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:05,943 INFO L124 PetriNetUnfolderBase]: 198/1448 cut-off events. [2024-11-12 12:40:05,943 INFO L125 PetriNetUnfolderBase]: For 128/129 co-relation queries the response was YES. [2024-11-12 12:40:05,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1912 conditions, 1448 events. 198/1448 cut-off events. For 128/129 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9452 event pairs, 64 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 1816. Up to 178 conditions per place. [2024-11-12 12:40:05,956 INFO L140 encePairwiseOnDemand]: 440/449 looper letters, 25 selfloop transitions, 5 changer transitions 0/348 dead transitions. [2024-11-12 12:40:05,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 348 transitions, 788 flow [2024-11-12 12:40:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-12 12:40:05,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8374164810690423 [2024-11-12 12:40:05,959 INFO L175 Difference]: Start difference. First operand has 351 places, 345 transitions, 712 flow. Second operand 3 states and 1128 transitions. [2024-11-12 12:40:05,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 348 transitions, 788 flow [2024-11-12 12:40:05,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 348 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:05,964 INFO L231 Difference]: Finished difference. Result has 346 places, 341 transitions, 713 flow [2024-11-12 12:40:05,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=346, PETRI_TRANSITIONS=341} [2024-11-12 12:40:05,965 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -71 predicate places. [2024-11-12 12:40:05,965 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 341 transitions, 713 flow [2024-11-12 12:40:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:05,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:05,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:05,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:40:05,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:05,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash 622162764, now seen corresponding path program 1 times [2024-11-12 12:40:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:05,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723548932] [2024-11-12 12:40:05,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:06,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723548932] [2024-11-12 12:40:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723548932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:06,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:06,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378330972] [2024-11-12 12:40:06,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:06,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:06,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 449 [2024-11-12 12:40:06,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 341 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:06,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:06,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 449 [2024-11-12 12:40:06,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:06,456 INFO L124 PetriNetUnfolderBase]: 490/2395 cut-off events. [2024-11-12 12:40:06,456 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-12 12:40:06,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3410 conditions, 2395 events. 490/2395 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 18240 event pairs, 104 based on Foata normal form. 0/2088 useless extension candidates. Maximal degree in co-relation 3313. Up to 661 conditions per place. [2024-11-12 12:40:06,474 INFO L140 encePairwiseOnDemand]: 441/449 looper letters, 29 selfloop transitions, 4 changer transitions 0/348 dead transitions. [2024-11-12 12:40:06,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 348 transitions, 799 flow [2024-11-12 12:40:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:40:06,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433556050482554 [2024-11-12 12:40:06,477 INFO L175 Difference]: Start difference. First operand has 346 places, 341 transitions, 713 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:40:06,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 348 transitions, 799 flow [2024-11-12 12:40:06,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 348 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:06,483 INFO L231 Difference]: Finished difference. Result has 343 places, 341 transitions, 723 flow [2024-11-12 12:40:06,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=343, PETRI_TRANSITIONS=341} [2024-11-12 12:40:06,483 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -74 predicate places. [2024-11-12 12:40:06,484 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 341 transitions, 723 flow [2024-11-12 12:40:06,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:06,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:06,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:06,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:40:06,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:06,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1265898742, now seen corresponding path program 1 times [2024-11-12 12:40:06,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:06,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383602024] [2024-11-12 12:40:06,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:06,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:06,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383602024] [2024-11-12 12:40:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383602024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813597770] [2024-11-12 12:40:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:06,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:06,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:06,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:06,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:06,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:06,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 341 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:06,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:06,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:06,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:06,868 INFO L124 PetriNetUnfolderBase]: 454/2016 cut-off events. [2024-11-12 12:40:06,868 INFO L125 PetriNetUnfolderBase]: For 214/215 co-relation queries the response was YES. [2024-11-12 12:40:06,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 2016 events. 454/2016 cut-off events. For 214/215 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 14786 event pairs, 172 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 2892. Up to 504 conditions per place. [2024-11-12 12:40:06,898 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 23 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2024-11-12 12:40:06,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 346 transitions, 789 flow [2024-11-12 12:40:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2024-11-12 12:40:06,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8478099480326652 [2024-11-12 12:40:06,901 INFO L175 Difference]: Start difference. First operand has 343 places, 341 transitions, 723 flow. Second operand 3 states and 1142 transitions. [2024-11-12 12:40:06,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 346 transitions, 789 flow [2024-11-12 12:40:06,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 789 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:06,906 INFO L231 Difference]: Finished difference. Result has 344 places, 340 transitions, 725 flow [2024-11-12 12:40:06,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=344, PETRI_TRANSITIONS=340} [2024-11-12 12:40:06,907 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -73 predicate places. [2024-11-12 12:40:06,907 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 340 transitions, 725 flow [2024-11-12 12:40:06,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:06,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:06,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:06,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:40:06,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:06,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:06,909 INFO L85 PathProgramCache]: Analyzing trace with hash -291596687, now seen corresponding path program 1 times [2024-11-12 12:40:06,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:06,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055210541] [2024-11-12 12:40:06,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055210541] [2024-11-12 12:40:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055210541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:06,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:06,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597270067] [2024-11-12 12:40:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:06,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:06,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:06,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 449 [2024-11-12 12:40:06,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 340 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:06,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:06,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 449 [2024-11-12 12:40:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:07,388 INFO L124 PetriNetUnfolderBase]: 383/2509 cut-off events. [2024-11-12 12:40:07,388 INFO L125 PetriNetUnfolderBase]: For 214/217 co-relation queries the response was YES. [2024-11-12 12:40:07,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3438 conditions, 2509 events. 383/2509 cut-off events. For 214/217 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 20052 event pairs, 165 based on Foata normal form. 0/2095 useless extension candidates. Maximal degree in co-relation 3341. Up to 414 conditions per place. [2024-11-12 12:40:07,417 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 27 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2024-11-12 12:40:07,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 346 transitions, 805 flow [2024-11-12 12:40:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:40:07,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433556050482554 [2024-11-12 12:40:07,420 INFO L175 Difference]: Start difference. First operand has 344 places, 340 transitions, 725 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:40:07,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 346 transitions, 805 flow [2024-11-12 12:40:07,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 346 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:07,427 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 723 flow [2024-11-12 12:40:07,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2024-11-12 12:40:07,428 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -74 predicate places. [2024-11-12 12:40:07,428 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 723 flow [2024-11-12 12:40:07,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:07,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:07,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 12:40:07,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:07,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash 389578159, now seen corresponding path program 1 times [2024-11-12 12:40:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:07,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287047253] [2024-11-12 12:40:07,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:07,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287047253] [2024-11-12 12:40:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287047253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:07,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072321972] [2024-11-12 12:40:07,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:07,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:07,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:07,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 449 [2024-11-12 12:40:07,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:07,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 449 [2024-11-12 12:40:07,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:07,899 INFO L124 PetriNetUnfolderBase]: 368/2591 cut-off events. [2024-11-12 12:40:07,900 INFO L125 PetriNetUnfolderBase]: For 219/220 co-relation queries the response was YES. [2024-11-12 12:40:07,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3510 conditions, 2591 events. 368/2591 cut-off events. For 219/220 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 21422 event pairs, 168 based on Foata normal form. 0/2178 useless extension candidates. Maximal degree in co-relation 3413. Up to 407 conditions per place. [2024-11-12 12:40:07,925 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 27 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2024-11-12 12:40:07,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 345 transitions, 803 flow [2024-11-12 12:40:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:40:07,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433556050482554 [2024-11-12 12:40:07,928 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 723 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:40:07,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 345 transitions, 803 flow [2024-11-12 12:40:07,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 345 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:07,934 INFO L231 Difference]: Finished difference. Result has 342 places, 338 transitions, 721 flow [2024-11-12 12:40:07,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=342, PETRI_TRANSITIONS=338} [2024-11-12 12:40:07,935 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -75 predicate places. [2024-11-12 12:40:07,935 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 338 transitions, 721 flow [2024-11-12 12:40:07,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:07,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:07,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 12:40:07,936 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:07,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1566511871, now seen corresponding path program 1 times [2024-11-12 12:40:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129094962] [2024-11-12 12:40:07,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129094962] [2024-11-12 12:40:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129094962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385114816] [2024-11-12 12:40:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:07,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:07,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:08,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 449 [2024-11-12 12:40:08,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 338 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 374.0) internal successors, (1122), 3 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:08,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 449 [2024-11-12 12:40:08,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:08,497 INFO L124 PetriNetUnfolderBase]: 519/2300 cut-off events. [2024-11-12 12:40:08,497 INFO L125 PetriNetUnfolderBase]: For 233/266 co-relation queries the response was YES. [2024-11-12 12:40:08,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 2300 events. 519/2300 cut-off events. For 233/266 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17616 event pairs, 218 based on Foata normal form. 0/1976 useless extension candidates. Maximal degree in co-relation 3248. Up to 562 conditions per place. [2024-11-12 12:40:08,522 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 25 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2024-11-12 12:40:08,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 344 transitions, 793 flow [2024-11-12 12:40:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1141 transitions. [2024-11-12 12:40:08,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8470675575352635 [2024-11-12 12:40:08,526 INFO L175 Difference]: Start difference. First operand has 342 places, 338 transitions, 721 flow. Second operand 3 states and 1141 transitions. [2024-11-12 12:40:08,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 344 transitions, 793 flow [2024-11-12 12:40:08,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 344 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:08,533 INFO L231 Difference]: Finished difference. Result has 341 places, 337 transitions, 719 flow [2024-11-12 12:40:08,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=341, PETRI_TRANSITIONS=337} [2024-11-12 12:40:08,534 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -76 predicate places. [2024-11-12 12:40:08,534 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 337 transitions, 719 flow [2024-11-12 12:40:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.0) internal successors, (1122), 3 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:08,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 12:40:08,535 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:08,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1008341059, now seen corresponding path program 1 times [2024-11-12 12:40:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:08,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923398130] [2024-11-12 12:40:08,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923398130] [2024-11-12 12:40:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923398130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:08,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391477718] [2024-11-12 12:40:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:08,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:08,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 449 [2024-11-12 12:40:08,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 337 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:08,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 449 [2024-11-12 12:40:08,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:08,922 INFO L124 PetriNetUnfolderBase]: 385/1707 cut-off events. [2024-11-12 12:40:08,922 INFO L125 PetriNetUnfolderBase]: For 184/185 co-relation queries the response was YES. [2024-11-12 12:40:08,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 1707 events. 385/1707 cut-off events. For 184/185 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 11398 event pairs, 137 based on Foata normal form. 0/1504 useless extension candidates. Maximal degree in co-relation 2449. Up to 362 conditions per place. [2024-11-12 12:40:08,935 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 21 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2024-11-12 12:40:08,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 781 flow [2024-11-12 12:40:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1146 transitions. [2024-11-12 12:40:08,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8507795100222717 [2024-11-12 12:40:08,938 INFO L175 Difference]: Start difference. First operand has 341 places, 337 transitions, 719 flow. Second operand 3 states and 1146 transitions. [2024-11-12 12:40:08,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 781 flow [2024-11-12 12:40:08,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 342 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:08,943 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 717 flow [2024-11-12 12:40:08,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2024-11-12 12:40:08,944 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -77 predicate places. [2024-11-12 12:40:08,944 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 717 flow [2024-11-12 12:40:08,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:08,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:08,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 12:40:08,945 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:08,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:08,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2019176314, now seen corresponding path program 1 times [2024-11-12 12:40:08,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:08,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899717382] [2024-11-12 12:40:08,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899717382] [2024-11-12 12:40:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899717382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:09,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246409963] [2024-11-12 12:40:09,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:09,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:09,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:09,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:09,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:09,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:09,358 INFO L124 PetriNetUnfolderBase]: 487/1784 cut-off events. [2024-11-12 12:40:09,359 INFO L125 PetriNetUnfolderBase]: For 224/225 co-relation queries the response was YES. [2024-11-12 12:40:09,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1784 events. 487/1784 cut-off events. For 224/225 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11755 event pairs, 199 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 2768. Up to 516 conditions per place. [2024-11-12 12:40:09,379 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 23 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2024-11-12 12:40:09,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 341 transitions, 783 flow [2024-11-12 12:40:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2024-11-12 12:40:09,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8478099480326652 [2024-11-12 12:40:09,382 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 717 flow. Second operand 3 states and 1142 transitions. [2024-11-12 12:40:09,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 341 transitions, 783 flow [2024-11-12 12:40:09,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:09,388 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 715 flow [2024-11-12 12:40:09,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2024-11-12 12:40:09,389 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -78 predicate places. [2024-11-12 12:40:09,389 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 715 flow [2024-11-12 12:40:09,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:09,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 12:40:09,391 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash -633796255, now seen corresponding path program 1 times [2024-11-12 12:40:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897092855] [2024-11-12 12:40:09,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897092855] [2024-11-12 12:40:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897092855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763880687] [2024-11-12 12:40:09,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:09,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:09,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:09,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 449 [2024-11-12 12:40:09,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:09,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 449 [2024-11-12 12:40:09,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:09,805 INFO L124 PetriNetUnfolderBase]: 414/2134 cut-off events. [2024-11-12 12:40:09,806 INFO L125 PetriNetUnfolderBase]: For 186/191 co-relation queries the response was YES. [2024-11-12 12:40:09,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 2134 events. 414/2134 cut-off events. For 186/191 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 16415 event pairs, 148 based on Foata normal form. 1/1909 useless extension candidates. Maximal degree in co-relation 2951. Up to 379 conditions per place. [2024-11-12 12:40:09,822 INFO L140 encePairwiseOnDemand]: 444/449 looper letters, 22 selfloop transitions, 2 changer transitions 6/340 dead transitions. [2024-11-12 12:40:09,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 340 transitions, 781 flow [2024-11-12 12:40:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2024-11-12 12:40:09,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463251670378619 [2024-11-12 12:40:09,825 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 715 flow. Second operand 3 states and 1140 transitions. [2024-11-12 12:40:09,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 340 transitions, 781 flow [2024-11-12 12:40:09,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 340 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:09,831 INFO L231 Difference]: Finished difference. Result has 337 places, 327 transitions, 699 flow [2024-11-12 12:40:09,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=337, PETRI_TRANSITIONS=327} [2024-11-12 12:40:09,832 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -80 predicate places. [2024-11-12 12:40:09,832 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 327 transitions, 699 flow [2024-11-12 12:40:09,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:09,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:09,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 12:40:09,833 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2032216472, now seen corresponding path program 1 times [2024-11-12 12:40:09,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:09,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5151389] [2024-11-12 12:40:09,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:09,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:09,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5151389] [2024-11-12 12:40:09,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5151389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:09,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:09,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:09,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792174780] [2024-11-12 12:40:09,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:09,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:09,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:09,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:09,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:09,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 327 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:09,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:09,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:10,163 INFO L124 PetriNetUnfolderBase]: 322/1639 cut-off events. [2024-11-12 12:40:10,163 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-12 12:40:10,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 1639 events. 322/1639 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11270 event pairs, 98 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 2285. Up to 265 conditions per place. [2024-11-12 12:40:10,179 INFO L140 encePairwiseOnDemand]: 444/449 looper letters, 21 selfloop transitions, 3 changer transitions 0/331 dead transitions. [2024-11-12 12:40:10,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 331 transitions, 761 flow [2024-11-12 12:40:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2024-11-12 12:40:10,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8478099480326652 [2024-11-12 12:40:10,182 INFO L175 Difference]: Start difference. First operand has 337 places, 327 transitions, 699 flow. Second operand 3 states and 1142 transitions. [2024-11-12 12:40:10,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 331 transitions, 761 flow [2024-11-12 12:40:10,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 331 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:10,187 INFO L231 Difference]: Finished difference. Result has 330 places, 325 transitions, 697 flow [2024-11-12 12:40:10,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=330, PETRI_TRANSITIONS=325} [2024-11-12 12:40:10,188 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -87 predicate places. [2024-11-12 12:40:10,188 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 325 transitions, 697 flow [2024-11-12 12:40:10,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:10,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:10,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 12:40:10,190 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1654841756, now seen corresponding path program 1 times [2024-11-12 12:40:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688146736] [2024-11-12 12:40:10,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:10,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:10,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688146736] [2024-11-12 12:40:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688146736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060668543] [2024-11-12 12:40:10,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:10,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:10,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:10,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 449 [2024-11-12 12:40:10,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 325 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:10,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 449 [2024-11-12 12:40:10,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:10,614 INFO L124 PetriNetUnfolderBase]: 523/2179 cut-off events. [2024-11-12 12:40:10,615 INFO L125 PetriNetUnfolderBase]: For 230/237 co-relation queries the response was YES. [2024-11-12 12:40:10,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 2179 events. 523/2179 cut-off events. For 230/237 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 16487 event pairs, 216 based on Foata normal form. 0/2000 useless extension candidates. Maximal degree in co-relation 3184. Up to 545 conditions per place. [2024-11-12 12:40:10,635 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 24 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2024-11-12 12:40:10,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 331 transitions, 767 flow [2024-11-12 12:40:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2024-11-12 12:40:10,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463251670378619 [2024-11-12 12:40:10,638 INFO L175 Difference]: Start difference. First operand has 330 places, 325 transitions, 697 flow. Second operand 3 states and 1140 transitions. [2024-11-12 12:40:10,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 331 transitions, 767 flow [2024-11-12 12:40:10,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 331 transitions, 761 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:10,643 INFO L231 Difference]: Finished difference. Result has 329 places, 324 transitions, 693 flow [2024-11-12 12:40:10,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=329, PETRI_TRANSITIONS=324} [2024-11-12 12:40:10,644 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -88 predicate places. [2024-11-12 12:40:10,644 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 324 transitions, 693 flow [2024-11-12 12:40:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:10,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:10,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 12:40:10,646 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1754243767, now seen corresponding path program 1 times [2024-11-12 12:40:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:10,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688037959] [2024-11-12 12:40:10,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:10,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:10,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688037959] [2024-11-12 12:40:10,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688037959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:10,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863957626] [2024-11-12 12:40:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:10,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:10,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:10,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 324 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:10,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:10,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:11,062 INFO L124 PetriNetUnfolderBase]: 353/1762 cut-off events. [2024-11-12 12:40:11,062 INFO L125 PetriNetUnfolderBase]: For 166/170 co-relation queries the response was YES. [2024-11-12 12:40:11,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 1762 events. 353/1762 cut-off events. For 166/170 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 12177 event pairs, 106 based on Foata normal form. 1/1656 useless extension candidates. Maximal degree in co-relation 2447. Up to 286 conditions per place. [2024-11-12 12:40:11,076 INFO L140 encePairwiseOnDemand]: 444/449 looper letters, 20 selfloop transitions, 2 changer transitions 10/329 dead transitions. [2024-11-12 12:40:11,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 329 transitions, 757 flow [2024-11-12 12:40:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2024-11-12 12:40:11,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8478099480326652 [2024-11-12 12:40:11,080 INFO L175 Difference]: Start difference. First operand has 329 places, 324 transitions, 693 flow. Second operand 3 states and 1142 transitions. [2024-11-12 12:40:11,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 329 transitions, 757 flow [2024-11-12 12:40:11,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 329 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:11,086 INFO L231 Difference]: Finished difference. Result has 327 places, 312 transitions, 668 flow [2024-11-12 12:40:11,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=327, PETRI_TRANSITIONS=312} [2024-11-12 12:40:11,086 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -90 predicate places. [2024-11-12 12:40:11,087 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 312 transitions, 668 flow [2024-11-12 12:40:11,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:11,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:11,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 12:40:11,088 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:11,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1835264861, now seen corresponding path program 1 times [2024-11-12 12:40:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002961812] [2024-11-12 12:40:11,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002961812] [2024-11-12 12:40:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002961812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:11,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:11,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021983656] [2024-11-12 12:40:11,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:11,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:11,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:11,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 312 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:11,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:11,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:11,491 INFO L124 PetriNetUnfolderBase]: 364/1635 cut-off events. [2024-11-12 12:40:11,491 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-11-12 12:40:11,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2472 conditions, 1635 events. 364/1635 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 10927 event pairs, 147 based on Foata normal form. 0/1531 useless extension candidates. Maximal degree in co-relation 2375. Up to 397 conditions per place. [2024-11-12 12:40:11,507 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 21 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2024-11-12 12:40:11,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 317 transitions, 730 flow [2024-11-12 12:40:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2024-11-12 12:40:11,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463251670378619 [2024-11-12 12:40:11,510 INFO L175 Difference]: Start difference. First operand has 327 places, 312 transitions, 668 flow. Second operand 3 states and 1140 transitions. [2024-11-12 12:40:11,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 317 transitions, 730 flow [2024-11-12 12:40:11,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 317 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:11,515 INFO L231 Difference]: Finished difference. Result has 316 places, 311 transitions, 666 flow [2024-11-12 12:40:11,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=316, PETRI_TRANSITIONS=311} [2024-11-12 12:40:11,516 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -101 predicate places. [2024-11-12 12:40:11,516 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 311 transitions, 666 flow [2024-11-12 12:40:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:11,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:11,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 12:40:11,518 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2024-11-12 12:40:11,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash 407896046, now seen corresponding path program 1 times [2024-11-12 12:40:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:11,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762830851] [2024-11-12 12:40:11,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:11,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762830851] [2024-11-12 12:40:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762830851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:11,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:11,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:11,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391642978] [2024-11-12 12:40:11,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:11,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:11,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 449 [2024-11-12 12:40:11,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 311 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:11,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 449 [2024-11-12 12:40:11,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:11,906 INFO L124 PetriNetUnfolderBase]: 415/1915 cut-off events. [2024-11-12 12:40:11,906 INFO L125 PetriNetUnfolderBase]: For 200/208 co-relation queries the response was YES. [2024-11-12 12:40:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1915 events. 415/1915 cut-off events. For 200/208 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 13540 event pairs, 166 based on Foata normal form. 0/1808 useless extension candidates. Maximal degree in co-relation 2738. Up to 440 conditions per place. [2024-11-12 12:40:11,915 INFO L140 encePairwiseOnDemand]: 446/449 looper letters, 0 selfloop transitions, 0 changer transitions 317/317 dead transitions. [2024-11-12 12:40:11,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 317 transitions, 732 flow [2024-11-12 12:40:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1141 transitions. [2024-11-12 12:40:11,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8470675575352635 [2024-11-12 12:40:11,918 INFO L175 Difference]: Start difference. First operand has 316 places, 311 transitions, 666 flow. Second operand 3 states and 1141 transitions. [2024-11-12 12:40:11,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 317 transitions, 732 flow [2024-11-12 12:40:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 317 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:11,921 INFO L231 Difference]: Finished difference. Result has 315 places, 0 transitions, 0 flow [2024-11-12 12:40:11,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=315, PETRI_TRANSITIONS=0} [2024-11-12 12:40:11,924 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -102 predicate places. [2024-11-12 12:40:11,924 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 0 transitions, 0 flow [2024-11-12 12:40:11,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (151 of 152 remaining) [2024-11-12 12:40:11,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (150 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (149 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (148 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (147 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (146 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (145 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (144 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (143 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (142 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (141 of 152 remaining) [2024-11-12 12:40:11,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (140 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (139 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (138 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (137 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (136 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (135 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (134 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (133 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (132 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (131 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (130 of 152 remaining) [2024-11-12 12:40:11,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (129 of 152 remaining) [2024-11-12 12:40:11,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (128 of 152 remaining) [2024-11-12 12:40:11,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 152 remaining) [2024-11-12 12:40:11,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (126 of 152 remaining) [2024-11-12 12:40:11,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (125 of 152 remaining) [2024-11-12 12:40:11,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (124 of 152 remaining) [2024-11-12 12:40:11,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (123 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (122 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (121 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (120 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (119 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (118 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (117 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (116 of 152 remaining) [2024-11-12 12:40:11,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (115 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (114 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (111 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (110 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (109 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (108 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (107 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (106 of 152 remaining) [2024-11-12 12:40:11,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (105 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (104 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (103 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (102 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (101 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (100 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (99 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (98 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (97 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (96 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (95 of 152 remaining) [2024-11-12 12:40:11,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (94 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (93 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (92 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (91 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (90 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (89 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (87 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (86 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (84 of 152 remaining) [2024-11-12 12:40:11,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (82 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (80 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (79 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (78 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (77 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (76 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (75 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 152 remaining) [2024-11-12 12:40:11,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (73 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (72 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (71 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (70 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (69 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (68 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (66 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (65 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (63 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (62 of 152 remaining) [2024-11-12 12:40:11,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (61 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (60 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (59 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (58 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (57 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (56 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (55 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (54 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (53 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (52 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (50 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 152 remaining) [2024-11-12 12:40:11,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (46 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (45 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (43 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (42 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (41 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (40 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (38 of 152 remaining) [2024-11-12 12:40:11,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (37 of 152 remaining) [2024-11-12 12:40:11,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (36 of 152 remaining) [2024-11-12 12:40:11,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (35 of 152 remaining) [2024-11-12 12:40:11,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 152 remaining) [2024-11-12 12:40:11,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (33 of 152 remaining) [2024-11-12 12:40:11,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (32 of 152 remaining) [2024-11-12 12:40:11,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (31 of 152 remaining) [2024-11-12 12:40:11,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (30 of 152 remaining) [2024-11-12 12:40:11,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (29 of 152 remaining) [2024-11-12 12:40:11,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 152 remaining) [2024-11-12 12:40:11,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (27 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (26 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (25 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (24 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (23 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (22 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (21 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (20 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (19 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (18 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (17 of 152 remaining) [2024-11-12 12:40:11,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (16 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (14 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (11 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (10 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (9 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (8 of 152 remaining) [2024-11-12 12:40:11,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (7 of 152 remaining) [2024-11-12 12:40:11,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 152 remaining) [2024-11-12 12:40:11,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 152 remaining) [2024-11-12 12:40:11,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (4 of 152 remaining) [2024-11-12 12:40:11,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (3 of 152 remaining) [2024-11-12 12:40:11,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (2 of 152 remaining) [2024-11-12 12:40:11,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (1 of 152 remaining) [2024-11-12 12:40:11,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (0 of 152 remaining) [2024-11-12 12:40:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 12:40:11,948 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:11,956 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:40:11,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:40:11,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:40:11 BasicIcfg [2024-11-12 12:40:11,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:40:11,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:40:11,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:40:11,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:40:11,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:59" (3/4) ... [2024-11-12 12:40:11,965 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:40:11,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:40:11,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:40:11,968 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-12 12:40:11,978 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-12 12:40:11,979 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:40:11,979 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:40:11,981 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:40:12,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:40:12,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:40:12,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:40:12,090 INFO L158 Benchmark]: Toolchain (without parser) took 14153.52ms. Allocated memory was 172.0MB in the beginning and 729.8MB in the end (delta: 557.8MB). Free memory was 117.9MB in the beginning and 622.6MB in the end (delta: -504.7MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,091 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:40:12,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.68ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 101.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.98ms. Allocated memory is still 172.0MB. Free memory was 101.8MB in the beginning and 98.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,093 INFO L158 Benchmark]: Boogie Preprocessor took 66.72ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 94.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,093 INFO L158 Benchmark]: RCFGBuilder took 1521.41ms. Allocated memory is still 172.0MB. Free memory was 94.8MB in the beginning and 53.7MB in the end (delta: 41.1MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,093 INFO L158 Benchmark]: TraceAbstraction took 12042.55ms. Allocated memory was 172.0MB in the beginning and 729.8MB in the end (delta: 557.8MB). Free memory was 53.5MB in the beginning and 628.9MB in the end (delta: -575.5MB). Peak memory consumption was 365.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,094 INFO L158 Benchmark]: Witness Printer took 126.73ms. Allocated memory is still 729.8MB. Free memory was 628.9MB in the beginning and 622.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,095 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.20ms. Allocated memory is still 172.0MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.68ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 101.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.98ms. Allocated memory is still 172.0MB. Free memory was 101.8MB in the beginning and 98.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.72ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 94.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1521.41ms. Allocated memory is still 172.0MB. Free memory was 94.8MB in the beginning and 53.7MB in the end (delta: 41.1MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12042.55ms. Allocated memory was 172.0MB in the beginning and 729.8MB in the end (delta: 557.8MB). Free memory was 53.5MB in the beginning and 628.9MB in the end (delta: -575.5MB). Peak memory consumption was 365.1MB. Max. memory is 16.1GB. * Witness Printer took 126.73ms. Allocated memory is still 729.8MB. Free memory was 628.9MB in the beginning and 622.6MB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 62]: 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: 62]: 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: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 587 locations, 152 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: 11.8s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1268 IncrementalHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 105 mSDtfsCounter, 1268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=0, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4006 NumberOfCodeBlocks, 4006 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3976 ConstructedInterpolants, 0 QuantifiedInterpolants, 4149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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 86 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:40:12,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE