./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:52:18,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:52:18,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:52:18,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:52:18,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:52:18,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:52:18,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:52:18,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:52:18,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:52:18,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:52:18,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:52:18,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:52:18,873 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:52:18,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:52:18,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:52:18,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:52:18,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:52:18,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:52:18,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:52:18,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:52:18,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:52:18,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:52:18,878 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:52:18,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:52:18,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:52:18,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:52:18,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:52:18,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:52:18,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:52:18,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:52:18,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:52:18,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:52:18,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:52:18,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:52:18,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:52:18,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:52:18,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:52:18,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:52:18,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:52:18,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:52:18,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:52:18,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 [2024-11-09 06:52:19,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:52:19,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:52:19,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:52:19,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:52:19,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:52:19,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2024-11-09 06:52:20,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:52:20,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:52:20,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2024-11-09 06:52:20,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430118f53/f3a73388ae80444e991f3caa9acad242/FLAG12ffa1663 [2024-11-09 06:52:20,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430118f53/f3a73388ae80444e991f3caa9acad242 [2024-11-09 06:52:20,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:52:20,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:52:20,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:52:20,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:52:20,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:52:20,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:52:20" (1/1) ... [2024-11-09 06:52:20,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b716ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:20, skipping insertion in model container [2024-11-09 06:52:20,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:52:20" (1/1) ... [2024-11-09 06:52:20,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:52:20,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:52:20,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:52:21,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:52:21,080 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:52:21,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21 WrapperNode [2024-11-09 06:52:21,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:52:21,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:52:21,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:52:21,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:52:21,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,133 INFO L138 Inliner]: procedures = 189, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 258 [2024-11-09 06:52:21,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:52:21,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:52:21,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:52:21,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:52:21,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:52:21,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:52:21,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:52:21,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:52:21,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (1/1) ... [2024-11-09 06:52:21,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:52:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:52:21,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:52:21,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:52:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:52:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:52:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:52:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:52:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:52:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:52:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:52:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:52:21,251 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:52:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:52:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:52:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:52:21,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:52:21,252 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:52:21,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:52:21,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:52:21,712 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:52:21,712 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:52:21,743 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:52:21,745 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:52:21,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:52:21 BoogieIcfgContainer [2024-11-09 06:52:21,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:52:21,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:52:21,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:52:21,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:52:21,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:52:20" (1/3) ... [2024-11-09 06:52:21,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d13aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:52:21, skipping insertion in model container [2024-11-09 06:52:21,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:21" (2/3) ... [2024-11-09 06:52:21,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d13aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:52:21, skipping insertion in model container [2024-11-09 06:52:21,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:52:21" (3/3) ... [2024-11-09 06:52:21,753 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_06-ptra_nr.i [2024-11-09 06:52:21,766 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:52:21,766 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-09 06:52:21,766 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:52:21,854 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:52:21,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 293 transitions, 590 flow [2024-11-09 06:52:21,975 INFO L124 PetriNetUnfolderBase]: 0/292 cut-off events. [2024-11-09 06:52:21,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:52:21,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 292 events. 0/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 94 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-09 06:52:21,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 293 transitions, 590 flow [2024-11-09 06:52:21,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 292 transitions, 587 flow [2024-11-09 06:52:21,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:52:22,000 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;@4c94daaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:52:22,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-11-09 06:52:22,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:52:22,015 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2024-11-09 06:52:22,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:52:22,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:22,016 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] [2024-11-09 06:52:22,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:22,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1012708, now seen corresponding path program 1 times [2024-11-09 06:52:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929652055] [2024-11-09 06:52:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929652055] [2024-11-09 06:52:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929652055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:52:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115904388] [2024-11-09 06:52:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:22,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:52:23,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2024-11-09 06:52:23,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 292 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:23,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:23,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2024-11-09 06:52:23,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:23,500 INFO L124 PetriNetUnfolderBase]: 220/1135 cut-off events. [2024-11-09 06:52:23,500 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:52:23,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 1135 events. 220/1135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5595 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1424. Up to 493 conditions per place. [2024-11-09 06:52:23,510 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/289 dead transitions. [2024-11-09 06:52:23,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 289 transitions, 715 flow [2024-11-09 06:52:23,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:52:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:52:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2024-11-09 06:52:23,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2024-11-09 06:52:23,532 INFO L175 Difference]: Start difference. First operand has 296 places, 292 transitions, 587 flow. Second operand 6 states and 1408 transitions. [2024-11-09 06:52:23,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 289 transitions, 715 flow [2024-11-09 06:52:23,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 289 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:52:23,541 INFO L231 Difference]: Finished difference. Result has 297 places, 289 transitions, 610 flow [2024-11-09 06:52:23,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=297, PETRI_TRANSITIONS=289} [2024-11-09 06:52:23,546 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 1 predicate places. [2024-11-09 06:52:23,548 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 289 transitions, 610 flow [2024-11-09 06:52:23,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:23,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:23,550 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-11-09 06:52:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:52:23,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:23,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash -778666570, now seen corresponding path program 1 times [2024-11-09 06:52:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:23,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822425160] [2024-11-09 06:52:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822425160] [2024-11-09 06:52:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822425160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:23,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:52:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933850886] [2024-11-09 06:52:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:23,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:23,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:52:24,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2024-11-09 06:52:24,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 289 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:24,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:24,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2024-11-09 06:52:24,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:24,335 INFO L124 PetriNetUnfolderBase]: 220/1132 cut-off events. [2024-11-09 06:52:24,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:52:24,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1132 events. 220/1132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5632 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1449. Up to 493 conditions per place. [2024-11-09 06:52:24,341 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/286 dead transitions. [2024-11-09 06:52:24,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 286 transitions, 738 flow [2024-11-09 06:52:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:52:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:52:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2024-11-09 06:52:24,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2024-11-09 06:52:24,344 INFO L175 Difference]: Start difference. First operand has 297 places, 289 transitions, 610 flow. Second operand 6 states and 1408 transitions. [2024-11-09 06:52:24,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 286 transitions, 738 flow [2024-11-09 06:52:24,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 286 transitions, 708 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:52:24,348 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 604 flow [2024-11-09 06:52:24,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2024-11-09 06:52:24,349 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, -2 predicate places. [2024-11-09 06:52:24,349 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 604 flow [2024-11-09 06:52:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:24,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:24,350 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] [2024-11-09 06:52:24,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:52:24,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:24,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash -672749740, now seen corresponding path program 1 times [2024-11-09 06:52:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:24,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202371524] [2024-11-09 06:52:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202371524] [2024-11-09 06:52:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202371524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:24,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:52:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847111134] [2024-11-09 06:52:24,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:52:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:24,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:52:24,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:52:24,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 293 [2024-11-09 06:52:24,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:24,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:24,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 293 [2024-11-09 06:52:24,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:24,475 INFO L124 PetriNetUnfolderBase]: 16/421 cut-off events. [2024-11-09 06:52:24,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:52:24,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 421 events. 16/421 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 779 event pairs, 16 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 291. Up to 47 conditions per place. [2024-11-09 06:52:24,477 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 14 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-11-09 06:52:24,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 285 transitions, 634 flow [2024-11-09 06:52:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:52:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:52:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2024-11-09 06:52:24,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9613196814562003 [2024-11-09 06:52:24,479 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 604 flow. Second operand 3 states and 845 transitions. [2024-11-09 06:52:24,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 285 transitions, 634 flow [2024-11-09 06:52:24,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 285 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:52:24,483 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 576 flow [2024-11-09 06:52:24,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=288, 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=576, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2024-11-09 06:52:24,484 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, -6 predicate places. [2024-11-09 06:52:24,484 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 576 flow [2024-11-09 06:52:24,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:24,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:24,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:24,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:52:24,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:24,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1411836732, now seen corresponding path program 1 times [2024-11-09 06:52:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249456405] [2024-11-09 06:52:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249456405] [2024-11-09 06:52:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249456405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:52:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236225071] [2024-11-09 06:52:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:52:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:24,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:52:24,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:52:24,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 293 [2024-11-09 06:52:24,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:24,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:24,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 293 [2024-11-09 06:52:24,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:24,577 INFO L124 PetriNetUnfolderBase]: 24/498 cut-off events. [2024-11-09 06:52:24,577 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:52:24,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 498 events. 24/498 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs, 24 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 458. Up to 63 conditions per place. [2024-11-09 06:52:24,579 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 15 selfloop transitions, 1 changer transitions 0/280 dead transitions. [2024-11-09 06:52:24,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 280 transitions, 598 flow [2024-11-09 06:52:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:52:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:52:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2024-11-09 06:52:24,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9522184300341296 [2024-11-09 06:52:24,591 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 576 flow. Second operand 3 states and 837 transitions. [2024-11-09 06:52:24,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 280 transitions, 598 flow [2024-11-09 06:52:24,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:52:24,594 INFO L231 Difference]: Finished difference. Result has 285 places, 280 transitions, 564 flow [2024-11-09 06:52:24,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=285, PETRI_TRANSITIONS=280} [2024-11-09 06:52:24,595 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, -11 predicate places. [2024-11-09 06:52:24,595 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 280 transitions, 564 flow [2024-11-09 06:52:24,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:24,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:24,596 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] [2024-11-09 06:52:24,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:52:24,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -314182069, now seen corresponding path program 1 times [2024-11-09 06:52:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663864230] [2024-11-09 06:52:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:24,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:24,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663864230] [2024-11-09 06:52:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663864230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:24,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:24,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:52:24,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251098128] [2024-11-09 06:52:24,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:24,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:24,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:24,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:24,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:52:25,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 293 [2024-11-09 06:52:25,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 280 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:25,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:25,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 293 [2024-11-09 06:52:25,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:25,399 INFO L124 PetriNetUnfolderBase]: 288/1275 cut-off events. [2024-11-09 06:52:25,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:52:25,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1275 events. 288/1275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6585 event pairs, 288 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1807. Up to 643 conditions per place. [2024-11-09 06:52:25,404 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 66 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2024-11-09 06:52:25,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 279 transitions, 704 flow [2024-11-09 06:52:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:52:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:52:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2024-11-09 06:52:25,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7952218430034129 [2024-11-09 06:52:25,407 INFO L175 Difference]: Start difference. First operand has 285 places, 280 transitions, 564 flow. Second operand 6 states and 1398 transitions. [2024-11-09 06:52:25,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 279 transitions, 704 flow [2024-11-09 06:52:25,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 279 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:52:25,410 INFO L231 Difference]: Finished difference. Result has 288 places, 279 transitions, 571 flow [2024-11-09 06:52:25,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=288, PETRI_TRANSITIONS=279} [2024-11-09 06:52:25,413 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2024-11-09 06:52:25,413 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 279 transitions, 571 flow [2024-11-09 06:52:25,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:25,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:25,415 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] [2024-11-09 06:52:25,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:52:25,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:25,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash 604617369, now seen corresponding path program 1 times [2024-11-09 06:52:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:25,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143120367] [2024-11-09 06:52:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143120367] [2024-11-09 06:52:25,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143120367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:25,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:52:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414929591] [2024-11-09 06:52:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:25,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:52:25,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:52:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:52:25,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 293 [2024-11-09 06:52:25,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:25,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:25,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 293 [2024-11-09 06:52:25,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:25,516 INFO L124 PetriNetUnfolderBase]: 6/342 cut-off events. [2024-11-09 06:52:25,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:52:25,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 342 events. 6/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 391 event pairs, 6 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 266. Up to 23 conditions per place. [2024-11-09 06:52:25,517 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-11-09 06:52:25,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 278 transitions, 593 flow [2024-11-09 06:52:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:52:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:52:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2024-11-09 06:52:25,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2024-11-09 06:52:25,519 INFO L175 Difference]: Start difference. First operand has 288 places, 279 transitions, 571 flow. Second operand 3 states and 853 transitions. [2024-11-09 06:52:25,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 278 transitions, 593 flow [2024-11-09 06:52:25,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:52:25,522 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 563 flow [2024-11-09 06:52:25,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2024-11-09 06:52:25,523 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, -12 predicate places. [2024-11-09 06:52:25,524 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 563 flow [2024-11-09 06:52:25,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:25,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:25,524 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] [2024-11-09 06:52:25,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:52:25,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:25,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:25,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1042183485, now seen corresponding path program 1 times [2024-11-09 06:52:25,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:25,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108531901] [2024-11-09 06:52:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:25,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108531901] [2024-11-09 06:52:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108531901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:25,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:25,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:52:25,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883113932] [2024-11-09 06:52:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:25,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:52:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:25,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:52:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:52:25,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 293 [2024-11-09 06:52:25,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:25,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:25,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 293 [2024-11-09 06:52:25,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:25,610 INFO L124 PetriNetUnfolderBase]: 4/339 cut-off events. [2024-11-09 06:52:25,610 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:52:25,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 339 events. 4/339 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 251 event pairs, 4 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 253. Up to 15 conditions per place. [2024-11-09 06:52:25,611 INFO L140 encePairwiseOnDemand]: 291/293 looper letters, 7 selfloop transitions, 1 changer transitions 0/277 dead transitions. [2024-11-09 06:52:25,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 277 transitions, 577 flow [2024-11-09 06:52:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:52:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:52:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-11-09 06:52:25,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9795221843003413 [2024-11-09 06:52:25,613 INFO L175 Difference]: Start difference. First operand has 284 places, 278 transitions, 563 flow. Second operand 3 states and 861 transitions. [2024-11-09 06:52:25,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 277 transitions, 577 flow [2024-11-09 06:52:25,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 277 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:52:25,618 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 559 flow [2024-11-09 06:52:25,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2024-11-09 06:52:25,620 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, -13 predicate places. [2024-11-09 06:52:25,620 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 559 flow [2024-11-09 06:52:25,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:25,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:25,622 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:25,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:52:25,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash 987461173, now seen corresponding path program 1 times [2024-11-09 06:52:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660294716] [2024-11-09 06:52:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660294716] [2024-11-09 06:52:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660294716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:26,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:26,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:52:26,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766025746] [2024-11-09 06:52:26,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:26,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:26,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:26,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:52:26,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 293 [2024-11-09 06:52:26,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:26,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:26,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 293 [2024-11-09 06:52:26,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:26,581 INFO L124 PetriNetUnfolderBase]: 316/1589 cut-off events. [2024-11-09 06:52:26,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:52:26,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1589 events. 316/1589 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9557 event pairs, 43 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 2209. Up to 388 conditions per place. [2024-11-09 06:52:26,587 INFO L140 encePairwiseOnDemand]: 265/293 looper letters, 107 selfloop transitions, 70 changer transitions 0/389 dead transitions. [2024-11-09 06:52:26,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 389 transitions, 1137 flow [2024-11-09 06:52:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:52:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:52:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2024-11-09 06:52:26,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2024-11-09 06:52:26,590 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 559 flow. Second operand 6 states and 1547 transitions. [2024-11-09 06:52:26,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 389 transitions, 1137 flow [2024-11-09 06:52:26,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 389 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:52:26,597 INFO L231 Difference]: Finished difference. Result has 291 places, 347 transitions, 1036 flow [2024-11-09 06:52:26,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1036, PETRI_PLACES=291, PETRI_TRANSITIONS=347} [2024-11-09 06:52:26,598 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, -5 predicate places. [2024-11-09 06:52:26,598 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 347 transitions, 1036 flow [2024-11-09 06:52:26,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:26,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:26,599 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:26,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:52:26,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:26,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 204481195, now seen corresponding path program 1 times [2024-11-09 06:52:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517354094] [2024-11-09 06:52:26,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517354094] [2024-11-09 06:52:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517354094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:27,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:52:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051950261] [2024-11-09 06:52:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:52:27,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2024-11-09 06:52:27,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 347 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:27,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:27,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2024-11-09 06:52:27,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:27,638 INFO L124 PetriNetUnfolderBase]: 588/2368 cut-off events. [2024-11-09 06:52:27,639 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2024-11-09 06:52:27,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2368 events. 588/2368 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15454 event pairs, 222 based on Foata normal form. 0/2256 useless extension candidates. Maximal degree in co-relation 4644. Up to 1090 conditions per place. [2024-11-09 06:52:27,647 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 114 selfloop transitions, 48 changer transitions 0/398 dead transitions. [2024-11-09 06:52:27,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 398 transitions, 1532 flow [2024-11-09 06:52:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:52:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:52:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2024-11-09 06:52:27,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2024-11-09 06:52:27,650 INFO L175 Difference]: Start difference. First operand has 291 places, 347 transitions, 1036 flow. Second operand 6 states and 1484 transitions. [2024-11-09 06:52:27,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 398 transitions, 1532 flow [2024-11-09 06:52:27,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 398 transitions, 1532 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:52:27,659 INFO L231 Difference]: Finished difference. Result has 301 places, 390 transitions, 1424 flow [2024-11-09 06:52:27,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1424, PETRI_PLACES=301, PETRI_TRANSITIONS=390} [2024-11-09 06:52:27,661 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 5 predicate places. [2024-11-09 06:52:27,661 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 390 transitions, 1424 flow [2024-11-09 06:52:27,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:27,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:27,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:27,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:52:27,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:27,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1899772781, now seen corresponding path program 1 times [2024-11-09 06:52:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:27,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698855883] [2024-11-09 06:52:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:28,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:28,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698855883] [2024-11-09 06:52:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698855883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:28,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:28,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:52:28,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481106141] [2024-11-09 06:52:28,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:28,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:28,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:28,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:52:28,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 293 [2024-11-09 06:52:28,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 390 transitions, 1424 flow. Second operand has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:28,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:28,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 293 [2024-11-09 06:52:28,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:28,774 INFO L124 PetriNetUnfolderBase]: 693/2817 cut-off events. [2024-11-09 06:52:28,774 INFO L125 PetriNetUnfolderBase]: For 1554/1606 co-relation queries the response was YES. [2024-11-09 06:52:28,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 2817 events. 693/2817 cut-off events. For 1554/1606 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19778 event pairs, 57 based on Foata normal form. 0/2726 useless extension candidates. Maximal degree in co-relation 6282. Up to 932 conditions per place. [2024-11-09 06:52:28,788 INFO L140 encePairwiseOnDemand]: 270/293 looper letters, 135 selfloop transitions, 136 changer transitions 4/530 dead transitions. [2024-11-09 06:52:28,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 530 transitions, 2730 flow [2024-11-09 06:52:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:52:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:52:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2024-11-09 06:52:28,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2024-11-09 06:52:28,792 INFO L175 Difference]: Start difference. First operand has 301 places, 390 transitions, 1424 flow. Second operand 6 states and 1547 transitions. [2024-11-09 06:52:28,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 530 transitions, 2730 flow [2024-11-09 06:52:28,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 530 transitions, 2712 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 06:52:28,806 INFO L231 Difference]: Finished difference. Result has 311 places, 521 transitions, 2772 flow [2024-11-09 06:52:28,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2772, PETRI_PLACES=311, PETRI_TRANSITIONS=521} [2024-11-09 06:52:28,807 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 15 predicate places. [2024-11-09 06:52:28,808 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 521 transitions, 2772 flow [2024-11-09 06:52:28,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:28,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:28,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:28,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:52:28,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:28,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash -632563920, now seen corresponding path program 1 times [2024-11-09 06:52:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14419141] [2024-11-09 06:52:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:29,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:29,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14419141] [2024-11-09 06:52:29,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14419141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:29,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:29,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:52:29,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988305329] [2024-11-09 06:52:29,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:29,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:52:29,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2024-11-09 06:52:29,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 521 transitions, 2772 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:29,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:29,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2024-11-09 06:52:29,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:29,823 INFO L124 PetriNetUnfolderBase]: 968/3493 cut-off events. [2024-11-09 06:52:29,824 INFO L125 PetriNetUnfolderBase]: For 3831/3903 co-relation queries the response was YES. [2024-11-09 06:52:29,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 3493 events. 968/3493 cut-off events. For 3831/3903 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 24892 event pairs, 207 based on Foata normal form. 0/3406 useless extension candidates. Maximal degree in co-relation 9602. Up to 1565 conditions per place. [2024-11-09 06:52:29,846 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 239 selfloop transitions, 62 changer transitions 0/578 dead transitions. [2024-11-09 06:52:29,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 578 transitions, 3716 flow [2024-11-09 06:52:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:52:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:52:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2024-11-09 06:52:29,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2024-11-09 06:52:29,850 INFO L175 Difference]: Start difference. First operand has 311 places, 521 transitions, 2772 flow. Second operand 6 states and 1484 transitions. [2024-11-09 06:52:29,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 578 transitions, 3716 flow [2024-11-09 06:52:29,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 578 transitions, 3680 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-09 06:52:29,872 INFO L231 Difference]: Finished difference. Result has 321 places, 570 transitions, 3362 flow [2024-11-09 06:52:29,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3362, PETRI_PLACES=321, PETRI_TRANSITIONS=570} [2024-11-09 06:52:29,873 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 25 predicate places. [2024-11-09 06:52:29,873 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 570 transitions, 3362 flow [2024-11-09 06:52:29,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:29,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:29,874 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:29,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:52:29,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:29,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1283758768, now seen corresponding path program 1 times [2024-11-09 06:52:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:29,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030446571] [2024-11-09 06:52:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030446571] [2024-11-09 06:52:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030446571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:30,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:30,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:52:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428869097] [2024-11-09 06:52:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:30,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:52:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:52:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:52:31,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:52:31,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 570 transitions, 3362 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:31,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:31,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:52:31,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:33,027 INFO L124 PetriNetUnfolderBase]: 1482/5034 cut-off events. [2024-11-09 06:52:33,028 INFO L125 PetriNetUnfolderBase]: For 8565/8665 co-relation queries the response was YES. [2024-11-09 06:52:33,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 5034 events. 1482/5034 cut-off events. For 8565/8665 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 40127 event pairs, 100 based on Foata normal form. 47/4999 useless extension candidates. Maximal degree in co-relation 15887. Up to 955 conditions per place. [2024-11-09 06:52:33,063 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 442 selfloop transitions, 192 changer transitions 1/881 dead transitions. [2024-11-09 06:52:33,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 881 transitions, 7168 flow [2024-11-09 06:52:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 06:52:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-09 06:52:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4321 transitions. [2024-11-09 06:52:33,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.776181067001976 [2024-11-09 06:52:33,071 INFO L175 Difference]: Start difference. First operand has 321 places, 570 transitions, 3362 flow. Second operand 19 states and 4321 transitions. [2024-11-09 06:52:33,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 881 transitions, 7168 flow [2024-11-09 06:52:33,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 881 transitions, 6986 flow, removed 91 selfloop flow, removed 0 redundant places. [2024-11-09 06:52:33,117 INFO L231 Difference]: Finished difference. Result has 348 places, 701 transitions, 5266 flow [2024-11-09 06:52:33,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5266, PETRI_PLACES=348, PETRI_TRANSITIONS=701} [2024-11-09 06:52:33,118 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 52 predicate places. [2024-11-09 06:52:33,118 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 701 transitions, 5266 flow [2024-11-09 06:52:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:33,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:33,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:33,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:52:33,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:33,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash 449689358, now seen corresponding path program 2 times [2024-11-09 06:52:33,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:33,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726630190] [2024-11-09 06:52:33,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:33,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:33,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726630190] [2024-11-09 06:52:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726630190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:33,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:52:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779130964] [2024-11-09 06:52:33,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:52:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:33,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:52:33,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:52:35,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:52:35,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 701 transitions, 5266 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:35,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:35,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:52:35,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:36,781 INFO L124 PetriNetUnfolderBase]: 2096/7132 cut-off events. [2024-11-09 06:52:36,782 INFO L125 PetriNetUnfolderBase]: For 17130/17345 co-relation queries the response was YES. [2024-11-09 06:52:36,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24346 conditions, 7132 events. 2096/7132 cut-off events. For 17130/17345 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 64366 event pairs, 150 based on Foata normal form. 82/7114 useless extension candidates. Maximal degree in co-relation 24191. Up to 1553 conditions per place. [2024-11-09 06:52:36,821 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 444 selfloop transitions, 258 changer transitions 4/952 dead transitions. [2024-11-09 06:52:36,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 952 transitions, 8766 flow [2024-11-09 06:52:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:52:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 06:52:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3289 transitions. [2024-11-09 06:52:36,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018039980497318 [2024-11-09 06:52:36,830 INFO L175 Difference]: Start difference. First operand has 348 places, 701 transitions, 5266 flow. Second operand 14 states and 3289 transitions. [2024-11-09 06:52:36,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 952 transitions, 8766 flow [2024-11-09 06:52:36,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 952 transitions, 8703 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-09 06:52:36,890 INFO L231 Difference]: Finished difference. Result has 366 places, 780 transitions, 7383 flow [2024-11-09 06:52:36,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7383, PETRI_PLACES=366, PETRI_TRANSITIONS=780} [2024-11-09 06:52:36,892 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 70 predicate places. [2024-11-09 06:52:36,892 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 780 transitions, 7383 flow [2024-11-09 06:52:36,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:36,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:36,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:36,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:52:36,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1607427598, now seen corresponding path program 3 times [2024-11-09 06:52:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932553686] [2024-11-09 06:52:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:37,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932553686] [2024-11-09 06:52:37,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932553686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:37,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:37,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:52:37,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296957308] [2024-11-09 06:52:37,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:37,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:52:37,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:52:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:52:38,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:52:38,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 780 transitions, 7383 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:38,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:38,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:52:38,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:40,129 INFO L124 PetriNetUnfolderBase]: 2168/7348 cut-off events. [2024-11-09 06:52:40,129 INFO L125 PetriNetUnfolderBase]: For 26050/26280 co-relation queries the response was YES. [2024-11-09 06:52:40,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27164 conditions, 7348 events. 2168/7348 cut-off events. For 26050/26280 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 66261 event pairs, 208 based on Foata normal form. 82/7316 useless extension candidates. Maximal degree in co-relation 26998. Up to 1395 conditions per place. [2024-11-09 06:52:40,195 INFO L140 encePairwiseOnDemand]: 268/293 looper letters, 538 selfloop transitions, 173 changer transitions 1/958 dead transitions. [2024-11-09 06:52:40,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 958 transitions, 10427 flow [2024-11-09 06:52:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 06:52:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-09 06:52:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4296 transitions. [2024-11-09 06:52:40,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7716903179450332 [2024-11-09 06:52:40,203 INFO L175 Difference]: Start difference. First operand has 366 places, 780 transitions, 7383 flow. Second operand 19 states and 4296 transitions. [2024-11-09 06:52:40,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 958 transitions, 10427 flow [2024-11-09 06:52:40,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 958 transitions, 10422 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 06:52:40,316 INFO L231 Difference]: Finished difference. Result has 390 places, 837 transitions, 8650 flow [2024-11-09 06:52:40,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=7378, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8650, PETRI_PLACES=390, PETRI_TRANSITIONS=837} [2024-11-09 06:52:40,318 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 94 predicate places. [2024-11-09 06:52:40,318 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 837 transitions, 8650 flow [2024-11-09 06:52:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:40,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:40,319 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:40,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:52:40,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1006544148, now seen corresponding path program 4 times [2024-11-09 06:52:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978033244] [2024-11-09 06:52:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978033244] [2024-11-09 06:52:40,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978033244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:40,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:40,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:52:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532770973] [2024-11-09 06:52:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:52:40,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:40,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:52:40,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:52:41,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:52:41,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 837 transitions, 8650 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:41,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:41,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:52:41,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:43,661 INFO L124 PetriNetUnfolderBase]: 2794/9476 cut-off events. [2024-11-09 06:52:43,662 INFO L125 PetriNetUnfolderBase]: For 40773/41106 co-relation queries the response was YES. [2024-11-09 06:52:43,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36378 conditions, 9476 events. 2794/9476 cut-off events. For 40773/41106 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 92510 event pairs, 275 based on Foata normal form. 122/9465 useless extension candidates. Maximal degree in co-relation 36202. Up to 1814 conditions per place. [2024-11-09 06:52:43,728 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 548 selfloop transitions, 295 changer transitions 4/1093 dead transitions. [2024-11-09 06:52:43,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1093 transitions, 13078 flow [2024-11-09 06:52:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:52:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 06:52:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3509 transitions. [2024-11-09 06:52:43,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7984072810011377 [2024-11-09 06:52:43,735 INFO L175 Difference]: Start difference. First operand has 390 places, 837 transitions, 8650 flow. Second operand 15 states and 3509 transitions. [2024-11-09 06:52:43,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1093 transitions, 13078 flow [2024-11-09 06:52:43,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1093 transitions, 12947 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-11-09 06:52:43,889 INFO L231 Difference]: Finished difference. Result has 406 places, 923 transitions, 11320 flow [2024-11-09 06:52:43,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=8554, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11320, PETRI_PLACES=406, PETRI_TRANSITIONS=923} [2024-11-09 06:52:43,891 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 110 predicate places. [2024-11-09 06:52:43,891 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 923 transitions, 11320 flow [2024-11-09 06:52:43,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:43,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:43,892 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:43,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:52:43,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:43,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 118760203, now seen corresponding path program 1 times [2024-11-09 06:52:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:43,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761755597] [2024-11-09 06:52:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:44,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761755597] [2024-11-09 06:52:44,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761755597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:44,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:44,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:52:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589519652] [2024-11-09 06:52:44,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:44,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:52:44,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:52:44,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:52:45,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 293 [2024-11-09 06:52:45,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 923 transitions, 11320 flow. Second operand has 13 states, 13 states have (on average 221.69230769230768) internal successors, (2882), 13 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:45,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:45,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 293 [2024-11-09 06:52:45,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:48,486 INFO L124 PetriNetUnfolderBase]: 3320/10585 cut-off events. [2024-11-09 06:52:48,487 INFO L125 PetriNetUnfolderBase]: For 55051/55369 co-relation queries the response was YES. [2024-11-09 06:52:48,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43492 conditions, 10585 events. 3320/10585 cut-off events. For 55051/55369 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 102954 event pairs, 434 based on Foata normal form. 60/10447 useless extension candidates. Maximal degree in co-relation 43305. Up to 2371 conditions per place. [2024-11-09 06:52:48,556 INFO L140 encePairwiseOnDemand]: 272/293 looper letters, 504 selfloop transitions, 173 changer transitions 0/1061 dead transitions. [2024-11-09 06:52:48,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1061 transitions, 14308 flow [2024-11-09 06:52:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:52:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 06:52:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3232 transitions. [2024-11-09 06:52:48,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.787908337396392 [2024-11-09 06:52:48,560 INFO L175 Difference]: Start difference. First operand has 406 places, 923 transitions, 11320 flow. Second operand 14 states and 3232 transitions. [2024-11-09 06:52:48,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 1061 transitions, 14308 flow [2024-11-09 06:52:48,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 1061 transitions, 14269 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-09 06:52:48,739 INFO L231 Difference]: Finished difference. Result has 421 places, 938 transitions, 12103 flow [2024-11-09 06:52:48,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11289, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12103, PETRI_PLACES=421, PETRI_TRANSITIONS=938} [2024-11-09 06:52:48,740 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 125 predicate places. [2024-11-09 06:52:48,740 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 938 transitions, 12103 flow [2024-11-09 06:52:48,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 221.69230769230768) internal successors, (2882), 13 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:48,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:48,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:48,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:52:48,742 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:48,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash -812693156, now seen corresponding path program 5 times [2024-11-09 06:52:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665228783] [2024-11-09 06:52:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665228783] [2024-11-09 06:52:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665228783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:52:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478584055] [2024-11-09 06:52:49,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:49,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:52:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:52:49,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:52:50,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:52:50,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 938 transitions, 12103 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:50,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:50,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:52:50,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:53,643 INFO L124 PetriNetUnfolderBase]: 3938/13413 cut-off events. [2024-11-09 06:52:53,644 INFO L125 PetriNetUnfolderBase]: For 80202/80829 co-relation queries the response was YES. [2024-11-09 06:52:53,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56388 conditions, 13413 events. 3938/13413 cut-off events. For 80202/80829 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 144305 event pairs, 362 based on Foata normal form. 162/13381 useless extension candidates. Maximal degree in co-relation 56195. Up to 2936 conditions per place. [2024-11-09 06:52:53,735 INFO L140 encePairwiseOnDemand]: 257/293 looper letters, 521 selfloop transitions, 449 changer transitions 3/1225 dead transitions. [2024-11-09 06:52:53,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1225 transitions, 18098 flow [2024-11-09 06:52:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:52:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 06:52:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3477 transitions. [2024-11-09 06:52:53,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7911262798634813 [2024-11-09 06:52:53,738 INFO L175 Difference]: Start difference. First operand has 421 places, 938 transitions, 12103 flow. Second operand 15 states and 3477 transitions. [2024-11-09 06:52:53,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 1225 transitions, 18098 flow [2024-11-09 06:52:53,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1225 transitions, 17903 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 06:52:54,004 INFO L231 Difference]: Finished difference. Result has 437 places, 1075 transitions, 16735 flow [2024-11-09 06:52:54,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11993, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=16735, PETRI_PLACES=437, PETRI_TRANSITIONS=1075} [2024-11-09 06:52:54,005 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 141 predicate places. [2024-11-09 06:52:54,005 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 1075 transitions, 16735 flow [2024-11-09 06:52:54,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:54,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:54,006 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:54,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:52:54,006 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:54,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1721565160, now seen corresponding path program 6 times [2024-11-09 06:52:54,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:54,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199383480] [2024-11-09 06:52:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:54,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:52:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199383480] [2024-11-09 06:52:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199383480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:52:54,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:52:54,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:52:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298163437] [2024-11-09 06:52:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:52:54,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:52:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:52:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:52:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:52:55,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:52:55,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1075 transitions, 16735 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:55,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:52:55,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:52:55,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:52:59,348 INFO L124 PetriNetUnfolderBase]: 4275/14539 cut-off events. [2024-11-09 06:52:59,348 INFO L125 PetriNetUnfolderBase]: For 112929/113596 co-relation queries the response was YES. [2024-11-09 06:52:59,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64000 conditions, 14539 events. 4275/14539 cut-off events. For 112929/113596 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 159371 event pairs, 367 based on Foata normal form. 184/14519 useless extension candidates. Maximal degree in co-relation 63797. Up to 2833 conditions per place. [2024-11-09 06:52:59,466 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 520 selfloop transitions, 501 changer transitions 1/1274 dead transitions. [2024-11-09 06:52:59,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1274 transitions, 21949 flow [2024-11-09 06:52:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 06:52:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-09 06:52:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4093 transitions. [2024-11-09 06:52:59,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7760712931361395 [2024-11-09 06:52:59,469 INFO L175 Difference]: Start difference. First operand has 437 places, 1075 transitions, 16735 flow. Second operand 18 states and 4093 transitions. [2024-11-09 06:52:59,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1274 transitions, 21949 flow [2024-11-09 06:52:59,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 1274 transitions, 21862 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-11-09 06:52:59,847 INFO L231 Difference]: Finished difference. Result has 459 places, 1147 transitions, 20449 flow [2024-11-09 06:52:59,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=16670, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=20449, PETRI_PLACES=459, PETRI_TRANSITIONS=1147} [2024-11-09 06:52:59,848 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 163 predicate places. [2024-11-09 06:52:59,848 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 1147 transitions, 20449 flow [2024-11-09 06:52:59,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:59,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:52:59,850 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:59,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:52:59,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:52:59,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2139935972, now seen corresponding path program 7 times [2024-11-09 06:52:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:52:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725066156] [2024-11-09 06:52:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:53:00,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:53:00,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725066156] [2024-11-09 06:53:00,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725066156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:00,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:53:00,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:53:00,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558956301] [2024-11-09 06:53:00,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:00,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:53:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:53:00,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:53:00,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:53:01,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:53:01,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1147 transitions, 20449 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:53:01,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:53:01,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:53:01,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:53:06,643 INFO L124 PetriNetUnfolderBase]: 5581/18896 cut-off events. [2024-11-09 06:53:06,643 INFO L125 PetriNetUnfolderBase]: For 168556/169551 co-relation queries the response was YES. [2024-11-09 06:53:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84657 conditions, 18896 events. 5581/18896 cut-off events. For 168556/169551 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 220582 event pairs, 421 based on Foata normal form. 299/18936 useless extension candidates. Maximal degree in co-relation 84445. Up to 3902 conditions per place. [2024-11-09 06:53:06,876 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 575 selfloop transitions, 605 changer transitions 4/1436 dead transitions. [2024-11-09 06:53:06,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1436 transitions, 27865 flow [2024-11-09 06:53:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 06:53:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-09 06:53:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4588 transitions. [2024-11-09 06:53:06,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7829351535836178 [2024-11-09 06:53:06,880 INFO L175 Difference]: Start difference. First operand has 459 places, 1147 transitions, 20449 flow. Second operand 20 states and 4588 transitions. [2024-11-09 06:53:06,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 1436 transitions, 27865 flow [2024-11-09 06:53:07,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1436 transitions, 27790 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-11-09 06:53:07,594 INFO L231 Difference]: Finished difference. Result has 480 places, 1273 transitions, 26301 flow [2024-11-09 06:53:07,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=20380, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=479, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=26301, PETRI_PLACES=480, PETRI_TRANSITIONS=1273} [2024-11-09 06:53:07,595 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 184 predicate places. [2024-11-09 06:53:07,595 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 1273 transitions, 26301 flow [2024-11-09 06:53:07,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:53:07,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:53:07,597 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:53:07,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:53:07,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:53:07,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:07,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2062492008, now seen corresponding path program 8 times [2024-11-09 06:53:07,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:53:07,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746559648] [2024-11-09 06:53:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:53:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:53:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:53:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746559648] [2024-11-09 06:53:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746559648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:08,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:53:08,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:53:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486675776] [2024-11-09 06:53:08,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:53:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:53:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:53:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:53:09,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:53:09,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 1273 transitions, 26301 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:53:09,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:53:09,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:53:09,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:53:14,987 INFO L124 PetriNetUnfolderBase]: 5953/20172 cut-off events. [2024-11-09 06:53:14,988 INFO L125 PetriNetUnfolderBase]: For 229254/230583 co-relation queries the response was YES. [2024-11-09 06:53:15,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94894 conditions, 20172 events. 5953/20172 cut-off events. For 229254/230583 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 238559 event pairs, 531 based on Foata normal form. 472/20361 useless extension candidates. Maximal degree in co-relation 94671. Up to 3957 conditions per place. [2024-11-09 06:53:15,191 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 674 selfloop transitions, 610 changer transitions 1/1537 dead transitions. [2024-11-09 06:53:15,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 1537 transitions, 33647 flow [2024-11-09 06:53:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 06:53:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-09 06:53:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4322 transitions. [2024-11-09 06:53:15,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7763606969642536 [2024-11-09 06:53:15,194 INFO L175 Difference]: Start difference. First operand has 480 places, 1273 transitions, 26301 flow. Second operand 19 states and 4322 transitions. [2024-11-09 06:53:15,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 1537 transitions, 33647 flow [2024-11-09 06:53:15,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 1537 transitions, 33555 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-11-09 06:53:16,000 INFO L231 Difference]: Finished difference. Result has 498 places, 1364 transitions, 30829 flow [2024-11-09 06:53:16,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=26213, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=521, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=30829, PETRI_PLACES=498, PETRI_TRANSITIONS=1364} [2024-11-09 06:53:16,001 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 202 predicate places. [2024-11-09 06:53:16,002 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 1364 transitions, 30829 flow [2024-11-09 06:53:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:53:16,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:53:16,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:53:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:53:16,003 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:53:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash 270774550, now seen corresponding path program 9 times [2024-11-09 06:53:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:53:16,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871447757] [2024-11-09 06:53:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:53:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:53:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:53:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871447757] [2024-11-09 06:53:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871447757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:53:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:53:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584549503] [2024-11-09 06:53:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:53:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:53:16,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:53:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:53:17,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:53:17,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 1364 transitions, 30829 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:53:17,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:53:17,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:53:17,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:53:24,524 INFO L124 PetriNetUnfolderBase]: 6558/22134 cut-off events. [2024-11-09 06:53:24,524 INFO L125 PetriNetUnfolderBase]: For 285343/286743 co-relation queries the response was YES. [2024-11-09 06:53:24,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107445 conditions, 22134 events. 6558/22134 cut-off events. For 285343/286743 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 267219 event pairs, 478 based on Foata normal form. 479/22320 useless extension candidates. Maximal degree in co-relation 107215. Up to 4365 conditions per place. [2024-11-09 06:53:24,784 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 684 selfloop transitions, 692 changer transitions 4/1632 dead transitions. [2024-11-09 06:53:24,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 1632 transitions, 38630 flow [2024-11-09 06:53:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 06:53:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-09 06:53:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 5034 transitions. [2024-11-09 06:53:24,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7809494260006206 [2024-11-09 06:53:24,787 INFO L175 Difference]: Start difference. First operand has 498 places, 1364 transitions, 30829 flow. Second operand 22 states and 5034 transitions. [2024-11-09 06:53:24,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 1632 transitions, 38630 flow [2024-11-09 06:53:26,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 1632 transitions, 38445 flow, removed 57 selfloop flow, removed 9 redundant places. [2024-11-09 06:53:26,062 INFO L231 Difference]: Finished difference. Result has 519 places, 1456 transitions, 36498 flow [2024-11-09 06:53:26,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=30662, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=602, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=36498, PETRI_PLACES=519, PETRI_TRANSITIONS=1456} [2024-11-09 06:53:26,063 INFO L277 CegarLoopForPetriNet]: 296 programPoint places, 223 predicate places. [2024-11-09 06:53:26,063 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 1456 transitions, 36498 flow [2024-11-09 06:53:26,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:53:26,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:53:26,064 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:53:26,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:53:26,064 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-09 06:53:26,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash -883006792, now seen corresponding path program 10 times [2024-11-09 06:53:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:53:26,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461620231] [2024-11-09 06:53:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:26,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:53:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:53:26,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:53:26,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461620231] [2024-11-09 06:53:26,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461620231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:26,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:53:26,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:53:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722468502] [2024-11-09 06:53:26,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:26,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:53:26,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:53:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:53:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:53:27,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2024-11-09 06:53:27,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 1456 transitions, 36498 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:53:27,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:53:27,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2024-11-09 06:53:27,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand