./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:14:32,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:14:32,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:14:32,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:14:32,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:14:32,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:14:32,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:14:32,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:14:32,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:14:32,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:14:32,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:14:32,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:14:32,869 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:14:32,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:14:32,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:14:32,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:14:32,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:14:32,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:14:32,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:14:32,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:14:32,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:14:32,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:14:32,872 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:14:32,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:14:32,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:14:32,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:14:32,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:14:32,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:14:32,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:14:32,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:14:32,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:14:32,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:14:32,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:14:32,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:14:32,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:14:32,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:14:32,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:14:32,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:14:32,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:14:32,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:14:32,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:14:32,880 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 [2024-10-11 17:14:33,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:14:33,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:14:33,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:14:33,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:14:33,151 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:14:33,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2024-10-11 17:14:34,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:14:34,990 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:14:34,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2024-10-11 17:14:34,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd91684ad/998f47e48a4049ffa313471b71f10fd0/FLAG4d69d4fc7 [2024-10-11 17:14:35,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd91684ad/998f47e48a4049ffa313471b71f10fd0 [2024-10-11 17:14:35,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:14:35,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:14:35,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:14:35,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:14:35,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:14:35,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c78a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35, skipping insertion in model container [2024-10-11 17:14:35,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:14:35,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:14:35,635 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:14:35,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:14:35,678 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:14:35,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35 WrapperNode [2024-10-11 17:14:35,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:14:35,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:14:35,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:14:35,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:14:35,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,723 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 239 [2024-10-11 17:14:35,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:14:35,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:14:35,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:14:35,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:14:35,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:14:35,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:14:35,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:14:35,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:14:35,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 17:14:35,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:14:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:14:35,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:14:35,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:14:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:14:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:14:35,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:14:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:14:35,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:14:35,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:14:35,854 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:14:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:14:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:14:35,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:14:35,855 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:14:35,955 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:14:35,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:14:36,246 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:14:36,246 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:14:36,271 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:14:36,271 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:14:36,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:36 BoogieIcfgContainer [2024-10-11 17:14:36,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:14:36,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:14:36,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:14:36,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:14:36,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:14:35" (1/3) ... [2024-10-11 17:14:36,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccc415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:36, skipping insertion in model container [2024-10-11 17:14:36,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (2/3) ... [2024-10-11 17:14:36,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccc415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:36, skipping insertion in model container [2024-10-11 17:14:36,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:36" (3/3) ... [2024-10-11 17:14:36,279 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2024-10-11 17:14:36,292 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:14:36,292 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-11 17:14:36,292 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:14:36,384 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:14:36,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 325 transitions, 671 flow [2024-10-11 17:14:36,547 INFO L124 PetriNetUnfolderBase]: 15/322 cut-off events. [2024-10-11 17:14:36,549 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:14:36,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 322 events. 15/322 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 741 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2024-10-11 17:14:36,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 325 transitions, 671 flow [2024-10-11 17:14:36,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 302 transitions, 622 flow [2024-10-11 17:14:36,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:14:36,590 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;@130efa07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:14:36,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-11 17:14:36,600 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:14:36,601 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-11 17:14:36,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:14:36,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:36,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:36,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:36,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash 182671358, now seen corresponding path program 1 times [2024-10-11 17:14:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:36,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114701851] [2024-10-11 17:14:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:36,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:36,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:36,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114701851] [2024-10-11 17:14:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114701851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:36,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922507251] [2024-10-11 17:14:36,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:36,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:36,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:36,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:36,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:36,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-11 17:14:36,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:36,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:36,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-11 17:14:36,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:37,118 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2024-10-11 17:14:37,119 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-11 17:14:37,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 649 events. 25/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3260 event pairs, 7 based on Foata normal form. 22/566 useless extension candidates. Maximal degree in co-relation 514. Up to 25 conditions per place. [2024-10-11 17:14:37,130 INFO L140 encePairwiseOnDemand]: 315/325 looper letters, 11 selfloop transitions, 2 changer transitions 1/294 dead transitions. [2024-10-11 17:14:37,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 294 transitions, 632 flow [2024-10-11 17:14:37,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-11 17:14:37,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-10-11 17:14:37,151 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 622 flow. Second operand 3 states and 924 transitions. [2024-10-11 17:14:37,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 294 transitions, 632 flow [2024-10-11 17:14:37,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 294 transitions, 620 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:14:37,161 INFO L231 Difference]: Finished difference. Result has 294 places, 293 transitions, 596 flow [2024-10-11 17:14:37,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=293} [2024-10-11 17:14:37,165 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -5 predicate places. [2024-10-11 17:14:37,166 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 293 transitions, 596 flow [2024-10-11 17:14:37,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:37,167 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:37,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:14:37,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1666545074, now seen corresponding path program 1 times [2024-10-11 17:14:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044770517] [2024-10-11 17:14:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:37,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044770517] [2024-10-11 17:14:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044770517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:37,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:37,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057914990] [2024-10-11 17:14:37,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:37,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:37,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:37,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:37,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-11 17:14:37,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:37,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-11 17:14:37,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:37,353 INFO L124 PetriNetUnfolderBase]: 21/551 cut-off events. [2024-10-11 17:14:37,353 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-11 17:14:37,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 551 events. 21/551 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2526 event pairs, 7 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 555. Up to 25 conditions per place. [2024-10-11 17:14:37,361 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-10-11 17:14:37,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 620 flow [2024-10-11 17:14:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-10-11 17:14:37,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-10-11 17:14:37,364 INFO L175 Difference]: Start difference. First operand has 294 places, 293 transitions, 596 flow. Second operand 3 states and 917 transitions. [2024-10-11 17:14:37,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 620 flow [2024-10-11 17:14:37,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 292 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:37,372 INFO L231 Difference]: Finished difference. Result has 292 places, 292 transitions, 594 flow [2024-10-11 17:14:37,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=292, PETRI_TRANSITIONS=292} [2024-10-11 17:14:37,373 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -7 predicate places. [2024-10-11 17:14:37,374 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 594 flow [2024-10-11 17:14:37,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:37,376 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:14:37,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2079277513, now seen corresponding path program 1 times [2024-10-11 17:14:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61100537] [2024-10-11 17:14:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:37,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:37,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61100537] [2024-10-11 17:14:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61100537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:37,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:37,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816795357] [2024-10-11 17:14:37,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:37,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:37,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:37,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:37,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-10-11 17:14:37,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:37,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-10-11 17:14:37,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:37,520 INFO L124 PetriNetUnfolderBase]: 20/460 cut-off events. [2024-10-11 17:14:37,520 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:14:37,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 460 events. 20/460 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1954 event pairs, 8 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 460. Up to 29 conditions per place. [2024-10-11 17:14:37,525 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-10-11 17:14:37,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 620 flow [2024-10-11 17:14:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2024-10-11 17:14:37,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2024-10-11 17:14:37,527 INFO L175 Difference]: Start difference. First operand has 292 places, 292 transitions, 594 flow. Second operand 3 states and 915 transitions. [2024-10-11 17:14:37,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 620 flow [2024-10-11 17:14:37,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:37,531 INFO L231 Difference]: Finished difference. Result has 291 places, 291 transitions, 592 flow [2024-10-11 17:14:37,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=291, PETRI_TRANSITIONS=291} [2024-10-11 17:14:37,532 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -8 predicate places. [2024-10-11 17:14:37,532 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 291 transitions, 592 flow [2024-10-11 17:14:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:37,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:37,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:14:37,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:37,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:37,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1640872581, now seen corresponding path program 1 times [2024-10-11 17:14:37,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:37,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646408222] [2024-10-11 17:14:37,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:37,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:37,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:37,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646408222] [2024-10-11 17:14:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646408222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:37,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:37,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:37,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811565133] [2024-10-11 17:14:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:37,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:37,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:37,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:37,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-11 17:14:37,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 291 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:37,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-11 17:14:37,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:37,638 INFO L124 PetriNetUnfolderBase]: 15/424 cut-off events. [2024-10-11 17:14:37,639 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-11 17:14:37,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 424 events. 15/424 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1661 event pairs, 5 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 407. Up to 22 conditions per place. [2024-10-11 17:14:37,644 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-10-11 17:14:37,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 290 transitions, 616 flow [2024-10-11 17:14:37,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-10-11 17:14:37,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-10-11 17:14:37,647 INFO L175 Difference]: Start difference. First operand has 291 places, 291 transitions, 592 flow. Second operand 3 states and 917 transitions. [2024-10-11 17:14:37,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 290 transitions, 616 flow [2024-10-11 17:14:37,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:37,650 INFO L231 Difference]: Finished difference. Result has 290 places, 290 transitions, 590 flow [2024-10-11 17:14:37,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=290, PETRI_TRANSITIONS=290} [2024-10-11 17:14:37,652 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2024-10-11 17:14:37,652 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 290 transitions, 590 flow [2024-10-11 17:14:37,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:37,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:14:37,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2125481100, now seen corresponding path program 1 times [2024-10-11 17:14:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:37,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060681611] [2024-10-11 17:14:37,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:37,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:37,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060681611] [2024-10-11 17:14:37,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060681611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:37,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810489755] [2024-10-11 17:14:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:37,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:37,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 325 [2024-10-11 17:14:37,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 290 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:37,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 325 [2024-10-11 17:14:37,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:37,814 INFO L124 PetriNetUnfolderBase]: 42/733 cut-off events. [2024-10-11 17:14:37,814 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-11 17:14:37,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 733 events. 42/733 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3774 event pairs, 20 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 736. Up to 50 conditions per place. [2024-10-11 17:14:37,823 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-10-11 17:14:37,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 289 transitions, 618 flow [2024-10-11 17:14:37,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2024-10-11 17:14:37,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9364102564102564 [2024-10-11 17:14:37,825 INFO L175 Difference]: Start difference. First operand has 290 places, 290 transitions, 590 flow. Second operand 3 states and 913 transitions. [2024-10-11 17:14:37,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 289 transitions, 618 flow [2024-10-11 17:14:37,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 289 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:37,829 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 588 flow [2024-10-11 17:14:37,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2024-10-11 17:14:37,832 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-10-11 17:14:37,832 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 588 flow [2024-10-11 17:14:37,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:37,833 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:37,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:14:37,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:37,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 372904994, now seen corresponding path program 1 times [2024-10-11 17:14:37,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:37,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548974249] [2024-10-11 17:14:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:37,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:37,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548974249] [2024-10-11 17:14:37,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548974249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:37,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:37,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215776384] [2024-10-11 17:14:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:37,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:37,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-10-11 17:14:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:37,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-10-11 17:14:37,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:37,966 INFO L124 PetriNetUnfolderBase]: 15/361 cut-off events. [2024-10-11 17:14:37,967 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-11 17:14:37,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 361 events. 15/361 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1268 event pairs, 7 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 330. Up to 25 conditions per place. [2024-10-11 17:14:37,971 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-10-11 17:14:37,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 288 transitions, 612 flow [2024-10-11 17:14:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-10-11 17:14:37,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-10-11 17:14:37,973 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 588 flow. Second operand 3 states and 917 transitions. [2024-10-11 17:14:37,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 288 transitions, 612 flow [2024-10-11 17:14:37,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 288 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:37,977 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 586 flow [2024-10-11 17:14:37,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2024-10-11 17:14:37,979 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-11 17:14:37,979 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 586 flow [2024-10-11 17:14:37,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:37,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:37,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:37,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:14:37,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 91897490, now seen corresponding path program 1 times [2024-10-11 17:14:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835163024] [2024-10-11 17:14:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:38,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835163024] [2024-10-11 17:14:38,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835163024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:38,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:38,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465631587] [2024-10-11 17:14:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:38,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:38,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:38,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:38,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:38,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:38,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:38,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:38,120 INFO L124 PetriNetUnfolderBase]: 46/884 cut-off events. [2024-10-11 17:14:38,120 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:14:38,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 884 events. 46/884 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5573 event pairs, 12 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 875. Up to 43 conditions per place. [2024-10-11 17:14:38,129 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-10-11 17:14:38,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 290 transitions, 622 flow [2024-10-11 17:14:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-10-11 17:14:38,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2024-10-11 17:14:38,132 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 586 flow. Second operand 3 states and 926 transitions. [2024-10-11 17:14:38,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 290 transitions, 622 flow [2024-10-11 17:14:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:38,136 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 592 flow [2024-10-11 17:14:38,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2024-10-11 17:14:38,137 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-11 17:14:38,137 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 592 flow [2024-10-11 17:14:38,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:38,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:38,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:14:38,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1824695897, now seen corresponding path program 1 times [2024-10-11 17:14:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595808936] [2024-10-11 17:14:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595808936] [2024-10-11 17:14:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595808936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:38,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:38,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815026226] [2024-10-11 17:14:38,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:38,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:38,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:38,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-10-11 17:14:38,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:38,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-10-11 17:14:38,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:38,305 INFO L124 PetriNetUnfolderBase]: 45/803 cut-off events. [2024-10-11 17:14:38,305 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:14:38,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 803 events. 45/803 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4856 event pairs, 10 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 733. Up to 49 conditions per place. [2024-10-11 17:14:38,317 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 15 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2024-10-11 17:14:38,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 634 flow [2024-10-11 17:14:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-10-11 17:14:38,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2024-10-11 17:14:38,321 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 592 flow. Second operand 3 states and 921 transitions. [2024-10-11 17:14:38,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 634 flow [2024-10-11 17:14:38,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:38,326 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 607 flow [2024-10-11 17:14:38,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2024-10-11 17:14:38,328 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-11 17:14:38,328 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 607 flow [2024-10-11 17:14:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:38,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:14:38,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:38,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1855236869, now seen corresponding path program 1 times [2024-10-11 17:14:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447268756] [2024-10-11 17:14:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447268756] [2024-10-11 17:14:38,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447268756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:38,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:38,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942747620] [2024-10-11 17:14:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:38,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:38,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:38,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:38,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:38,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:38,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:38,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:38,566 INFO L124 PetriNetUnfolderBase]: 38/959 cut-off events. [2024-10-11 17:14:38,567 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-10-11 17:14:38,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 959 events. 38/959 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5918 event pairs, 4 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 847. Up to 53 conditions per place. [2024-10-11 17:14:38,581 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-10-11 17:14:38,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 293 transitions, 658 flow [2024-10-11 17:14:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-10-11 17:14:38,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2024-10-11 17:14:38,584 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 607 flow. Second operand 3 states and 929 transitions. [2024-10-11 17:14:38,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 293 transitions, 658 flow [2024-10-11 17:14:38,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 293 transitions, 658 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:38,589 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 617 flow [2024-10-11 17:14:38,589 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2024-10-11 17:14:38,590 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-11 17:14:38,590 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 617 flow [2024-10-11 17:14:38,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:38,591 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:38,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:14:38,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:38,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash -471178849, now seen corresponding path program 1 times [2024-10-11 17:14:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702240612] [2024-10-11 17:14:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:38,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702240612] [2024-10-11 17:14:38,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702240612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:38,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:38,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:38,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626540870] [2024-10-11 17:14:38,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:38,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:38,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:38,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:38,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:38,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:38,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:38,775 INFO L124 PetriNetUnfolderBase]: 33/1027 cut-off events. [2024-10-11 17:14:38,775 INFO L125 PetriNetUnfolderBase]: For 15/25 co-relation queries the response was YES. [2024-10-11 17:14:38,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1027 events. 33/1027 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5838 event pairs, 4 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 965. Up to 51 conditions per place. [2024-10-11 17:14:38,787 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-10-11 17:14:38,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 293 transitions, 668 flow [2024-10-11 17:14:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-10-11 17:14:38,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2024-10-11 17:14:38,792 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 617 flow. Second operand 3 states and 929 transitions. [2024-10-11 17:14:38,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 293 transitions, 668 flow [2024-10-11 17:14:38,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:38,796 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 627 flow [2024-10-11 17:14:38,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2024-10-11 17:14:38,797 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-10-11 17:14:38,798 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 627 flow [2024-10-11 17:14:38,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:38,798 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:14:38,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1134306589, now seen corresponding path program 1 times [2024-10-11 17:14:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:38,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094316428] [2024-10-11 17:14:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:38,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094316428] [2024-10-11 17:14:38,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094316428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:38,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:38,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883204863] [2024-10-11 17:14:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:38,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:38,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:38,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:38,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 325 [2024-10-11 17:14:38,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:38,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 325 [2024-10-11 17:14:38,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:38,960 INFO L124 PetriNetUnfolderBase]: 34/997 cut-off events. [2024-10-11 17:14:38,960 INFO L125 PetriNetUnfolderBase]: For 4/17 co-relation queries the response was YES. [2024-10-11 17:14:38,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 997 events. 34/997 cut-off events. For 4/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5841 event pairs, 8 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 965. Up to 38 conditions per place. [2024-10-11 17:14:38,973 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-10-11 17:14:38,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 657 flow [2024-10-11 17:14:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-10-11 17:14:38,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2024-10-11 17:14:38,976 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 627 flow. Second operand 3 states and 926 transitions. [2024-10-11 17:14:38,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 657 flow [2024-10-11 17:14:38,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:38,980 INFO L231 Difference]: Finished difference. Result has 290 places, 287 transitions, 629 flow [2024-10-11 17:14:38,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=290, PETRI_TRANSITIONS=287} [2024-10-11 17:14:38,981 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2024-10-11 17:14:38,981 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 287 transitions, 629 flow [2024-10-11 17:14:38,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:38,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:38,982 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:38,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:14:38,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:38,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2083931817, now seen corresponding path program 1 times [2024-10-11 17:14:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:38,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263623234] [2024-10-11 17:14:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263623234] [2024-10-11 17:14:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263623234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:39,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503185798] [2024-10-11 17:14:39,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:39,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:39,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:39,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 325 [2024-10-11 17:14:39,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 287 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:39,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:39,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 325 [2024-10-11 17:14:39,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:39,244 INFO L124 PetriNetUnfolderBase]: 226/2802 cut-off events. [2024-10-11 17:14:39,244 INFO L125 PetriNetUnfolderBase]: For 71/221 co-relation queries the response was YES. [2024-10-11 17:14:39,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2802 events. 226/2802 cut-off events. For 71/221 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25428 event pairs, 100 based on Foata normal form. 1/2502 useless extension candidates. Maximal degree in co-relation 2762. Up to 329 conditions per place. [2024-10-11 17:14:39,270 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 17 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2024-10-11 17:14:39,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 677 flow [2024-10-11 17:14:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2024-10-11 17:14:39,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2024-10-11 17:14:39,272 INFO L175 Difference]: Start difference. First operand has 290 places, 287 transitions, 629 flow. Second operand 3 states and 916 transitions. [2024-10-11 17:14:39,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 677 flow [2024-10-11 17:14:39,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:39,276 INFO L231 Difference]: Finished difference. Result has 287 places, 287 transitions, 645 flow [2024-10-11 17:14:39,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=287, PETRI_TRANSITIONS=287} [2024-10-11 17:14:39,277 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-11 17:14:39,277 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 287 transitions, 645 flow [2024-10-11 17:14:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:39,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:39,278 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:39,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:14:39,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:39,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2005244654, now seen corresponding path program 1 times [2024-10-11 17:14:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:39,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692926788] [2024-10-11 17:14:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:39,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:39,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:39,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692926788] [2024-10-11 17:14:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692926788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:39,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946571487] [2024-10-11 17:14:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:39,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:39,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:39,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 287 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:39,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:39,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:39,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:39,524 INFO L124 PetriNetUnfolderBase]: 108/2656 cut-off events. [2024-10-11 17:14:39,524 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2024-10-11 17:14:39,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 2656 events. 108/2656 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 23423 event pairs, 14 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 2473. Up to 164 conditions per place. [2024-10-11 17:14:39,597 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 15 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-10-11 17:14:39,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 691 flow [2024-10-11 17:14:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-10-11 17:14:39,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-10-11 17:14:39,599 INFO L175 Difference]: Start difference. First operand has 287 places, 287 transitions, 645 flow. Second operand 3 states and 928 transitions. [2024-10-11 17:14:39,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 691 flow [2024-10-11 17:14:39,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 291 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:39,603 INFO L231 Difference]: Finished difference. Result has 288 places, 287 transitions, 655 flow [2024-10-11 17:14:39,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=287} [2024-10-11 17:14:39,604 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-11 17:14:39,604 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 287 transitions, 655 flow [2024-10-11 17:14:39,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:39,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:39,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:39,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:14:39,605 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:39,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash -684237204, now seen corresponding path program 1 times [2024-10-11 17:14:39,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:39,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395478838] [2024-10-11 17:14:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:39,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395478838] [2024-10-11 17:14:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395478838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:39,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:39,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600390664] [2024-10-11 17:14:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:39,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:39,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:39,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:39,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 287 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:39,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:39,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:39,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:39,883 INFO L124 PetriNetUnfolderBase]: 97/2277 cut-off events. [2024-10-11 17:14:39,884 INFO L125 PetriNetUnfolderBase]: For 24/60 co-relation queries the response was YES. [2024-10-11 17:14:39,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2277 events. 97/2277 cut-off events. For 24/60 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 19422 event pairs, 18 based on Foata normal form. 2/2073 useless extension candidates. Maximal degree in co-relation 2097. Up to 73 conditions per place. [2024-10-11 17:14:39,898 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-10-11 17:14:39,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 687 flow [2024-10-11 17:14:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-11 17:14:39,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-10-11 17:14:39,901 INFO L175 Difference]: Start difference. First operand has 288 places, 287 transitions, 655 flow. Second operand 3 states and 924 transitions. [2024-10-11 17:14:39,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 687 flow [2024-10-11 17:14:39,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 687 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:39,906 INFO L231 Difference]: Finished difference. Result has 289 places, 286 transitions, 657 flow [2024-10-11 17:14:39,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=289, PETRI_TRANSITIONS=286} [2024-10-11 17:14:39,907 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-10-11 17:14:39,907 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 286 transitions, 657 flow [2024-10-11 17:14:39,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:39,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:39,908 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:39,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:14:39,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:39,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1908473204, now seen corresponding path program 1 times [2024-10-11 17:14:39,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:39,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245466408] [2024-10-11 17:14:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:39,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:39,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245466408] [2024-10-11 17:14:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245466408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:39,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:39,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277846709] [2024-10-11 17:14:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:39,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:39,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:39,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:39,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:39,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:39,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:40,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L55-25-->L55-26: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet12#1][181], [Black: 349#true, 368#true, 24#L55-26true, Black: 353#true, 362#(= |#race~length_4~0| 0), 70#L76true, 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 351#(= |#race~to_int_1~0| 0), 371#true, Black: 345#true, 355#(= |#race~to_int_3~0| 0)]) [2024-10-11 17:14:40,131 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2024-10-11 17:14:40,131 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is not cut-off event [2024-10-11 17:14:40,131 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-11 17:14:40,131 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-11 17:14:40,133 INFO L124 PetriNetUnfolderBase]: 131/1723 cut-off events. [2024-10-11 17:14:40,133 INFO L125 PetriNetUnfolderBase]: For 86/123 co-relation queries the response was YES. [2024-10-11 17:14:40,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1723 events. 131/1723 cut-off events. For 86/123 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14175 event pairs, 36 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1885. Up to 169 conditions per place. [2024-10-11 17:14:40,149 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-10-11 17:14:40,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 287 transitions, 689 flow [2024-10-11 17:14:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-11 17:14:40,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-10-11 17:14:40,151 INFO L175 Difference]: Start difference. First operand has 289 places, 286 transitions, 657 flow. Second operand 3 states and 924 transitions. [2024-10-11 17:14:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 287 transitions, 689 flow [2024-10-11 17:14:40,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 287 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:40,157 INFO L231 Difference]: Finished difference. Result has 288 places, 285 transitions, 655 flow [2024-10-11 17:14:40,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=285} [2024-10-11 17:14:40,157 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-10-11 17:14:40,157 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 285 transitions, 655 flow [2024-10-11 17:14:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:40,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:40,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:40,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:14:40,158 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:40,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2108863995, now seen corresponding path program 1 times [2024-10-11 17:14:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905830098] [2024-10-11 17:14:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905830098] [2024-10-11 17:14:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905830098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:40,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998996920] [2024-10-11 17:14:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:40,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:40,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:40,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2024-10-11 17:14:40,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 285 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:40,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:40,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2024-10-11 17:14:40,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:40,390 INFO L124 PetriNetUnfolderBase]: 68/2037 cut-off events. [2024-10-11 17:14:40,390 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2024-10-11 17:14:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 2037 events. 68/2037 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 16336 event pairs, 4 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2046. Up to 66 conditions per place. [2024-10-11 17:14:40,408 INFO L140 encePairwiseOnDemand]: 323/325 looper letters, 8 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-10-11 17:14:40,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 284 transitions, 671 flow [2024-10-11 17:14:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-10-11 17:14:40,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-10-11 17:14:40,410 INFO L175 Difference]: Start difference. First operand has 288 places, 285 transitions, 655 flow. Second operand 3 states and 928 transitions. [2024-10-11 17:14:40,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 284 transitions, 671 flow [2024-10-11 17:14:40,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:40,415 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 651 flow [2024-10-11 17:14:40,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2024-10-11 17:14:40,416 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-10-11 17:14:40,416 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 651 flow [2024-10-11 17:14:40,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:40,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:40,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:40,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:14:40,417 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:40,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1653121731, now seen corresponding path program 1 times [2024-10-11 17:14:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:40,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523111976] [2024-10-11 17:14:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:40,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523111976] [2024-10-11 17:14:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523111976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994426198] [2024-10-11 17:14:40,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:40,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:40,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:40,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:40,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:40,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:40,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:40,651 INFO L124 PetriNetUnfolderBase]: 70/2113 cut-off events. [2024-10-11 17:14:40,651 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2024-10-11 17:14:40,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 2113 events. 70/2113 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17249 event pairs, 9 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 2290. Up to 70 conditions per place. [2024-10-11 17:14:40,665 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2024-10-11 17:14:40,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 282 transitions, 669 flow [2024-10-11 17:14:40,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 922 transitions. [2024-10-11 17:14:40,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456410256410256 [2024-10-11 17:14:40,668 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 651 flow. Second operand 3 states and 922 transitions. [2024-10-11 17:14:40,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 282 transitions, 669 flow [2024-10-11 17:14:40,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 282 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:14:40,671 INFO L231 Difference]: Finished difference. Result has 286 places, 282 transitions, 648 flow [2024-10-11 17:14:40,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=286, PETRI_TRANSITIONS=282} [2024-10-11 17:14:40,672 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -13 predicate places. [2024-10-11 17:14:40,672 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 282 transitions, 648 flow [2024-10-11 17:14:40,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:40,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:40,673 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:40,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:14:40,673 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:40,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1638243199, now seen corresponding path program 1 times [2024-10-11 17:14:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:40,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646257478] [2024-10-11 17:14:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646257478] [2024-10-11 17:14:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646257478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:40,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417347861] [2024-10-11 17:14:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:40,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:40,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-10-11 17:14:40,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 282 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:40,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:40,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-10-11 17:14:40,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:40,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([854] L55-26-->L55-27: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_1|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_8~0][187], [Black: 349#true, Black: 353#true, 362#(= |#race~length_4~0| 0), 70#L76true, 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 380#true, 351#(= |#race~to_int_1~0| 0), 377#true, Black: 345#true, 89#L55-27true, 355#(= |#race~to_int_3~0| 0)]) [2024-10-11 17:14:40,848 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-11 17:14:40,848 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-11 17:14:40,848 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-11 17:14:40,849 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-11 17:14:40,851 INFO L124 PetriNetUnfolderBase]: 68/1516 cut-off events. [2024-10-11 17:14:40,851 INFO L125 PetriNetUnfolderBase]: For 20/36 co-relation queries the response was YES. [2024-10-11 17:14:40,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1516 events. 68/1516 cut-off events. For 20/36 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11442 event pairs, 18 based on Foata normal form. 5/1415 useless extension candidates. Maximal degree in co-relation 1719. Up to 89 conditions per place. [2024-10-11 17:14:40,863 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 0 selfloop transitions, 0 changer transitions 280/280 dead transitions. [2024-10-11 17:14:40,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 280 transitions, 664 flow [2024-10-11 17:14:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-10-11 17:14:40,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2024-10-11 17:14:40,865 INFO L175 Difference]: Start difference. First operand has 286 places, 282 transitions, 648 flow. Second operand 3 states and 921 transitions. [2024-10-11 17:14:40,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 280 transitions, 664 flow [2024-10-11 17:14:40,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:14:40,867 INFO L231 Difference]: Finished difference. Result has 285 places, 0 transitions, 0 flow [2024-10-11 17:14:40,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=285, PETRI_TRANSITIONS=0} [2024-10-11 17:14:40,868 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -14 predicate places. [2024-10-11 17:14:40,868 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 0 transitions, 0 flow [2024-10-11 17:14:40,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-10-11 17:14:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-10-11 17:14:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-10-11 17:14:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-10-11 17:14:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-10-11 17:14:40,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-10-11 17:14:40,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-10-11 17:14:40,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-10-11 17:14:40,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-10-11 17:14:40,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-10-11 17:14:40,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-10-11 17:14:40,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-10-11 17:14:40,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-10-11 17:14:40,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-10-11 17:14:40,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-10-11 17:14:40,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-10-11 17:14:40,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-10-11 17:14:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-10-11 17:14:40,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 50 remaining) [2024-10-11 17:14:40,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-10-11 17:14:40,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-10-11 17:14:40,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-10-11 17:14:40,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-10-11 17:14:40,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-10-11 17:14:40,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-10-11 17:14:40,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-10-11 17:14:40,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-10-11 17:14:40,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-10-11 17:14:40,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:14:40,884 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:40,890 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:14:40,890 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:14:40,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:14:40 BasicIcfg [2024-10-11 17:14:40,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:14:40,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:14:40,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:14:40,895 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:14:40,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:36" (3/4) ... [2024-10-11 17:14:40,897 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:14:40,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:14:40,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:14:40,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:14:40,905 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 17:14:40,905 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:14:40,905 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:14:40,906 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:14:40,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:14:40,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:14:40,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:14:40,997 INFO L158 Benchmark]: Toolchain (without parser) took 5633.49ms. Allocated memory was 138.4MB in the beginning and 325.1MB in the end (delta: 186.6MB). Free memory was 69.0MB in the beginning and 286.7MB in the end (delta: -217.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:40,997 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:40,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.44ms. Allocated memory was 138.4MB in the beginning and 213.9MB in the end (delta: 75.5MB). Free memory was 68.9MB in the beginning and 184.4MB in the end (delta: -115.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-11 17:14:40,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.16ms. Allocated memory is still 213.9MB. Free memory was 184.4MB in the beginning and 181.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:40,998 INFO L158 Benchmark]: Boogie Preprocessor took 22.89ms. Allocated memory is still 213.9MB. Free memory was 181.3MB in the beginning and 180.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:40,998 INFO L158 Benchmark]: RCFGBuilder took 523.87ms. Allocated memory is still 213.9MB. Free memory was 180.3MB in the beginning and 155.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:40,998 INFO L158 Benchmark]: TraceAbstraction took 4620.88ms. Allocated memory was 213.9MB in the beginning and 325.1MB in the end (delta: 111.1MB). Free memory was 155.1MB in the beginning and 292.0MB in the end (delta: -136.9MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:40,999 INFO L158 Benchmark]: Witness Printer took 101.93ms. Allocated memory is still 325.1MB. Free memory was 292.0MB in the beginning and 286.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:41,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.44ms. Allocated memory was 138.4MB in the beginning and 213.9MB in the end (delta: 75.5MB). Free memory was 68.9MB in the beginning and 184.4MB in the end (delta: -115.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.16ms. Allocated memory is still 213.9MB. Free memory was 184.4MB in the beginning and 181.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.89ms. Allocated memory is still 213.9MB. Free memory was 181.3MB in the beginning and 180.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 523.87ms. Allocated memory is still 213.9MB. Free memory was 180.3MB in the beginning and 155.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4620.88ms. Allocated memory was 213.9MB in the beginning and 325.1MB in the end (delta: 111.1MB). Free memory was 155.1MB in the beginning and 292.0MB in the end (delta: -136.9MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. * Witness Printer took 101.93ms. Allocated memory is still 325.1MB. Free memory was 292.0MB in the beginning and 286.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 488 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 87 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=14, InterpolantAutomatonStates: 54, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1477 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:14:41,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE