/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 21:37:48,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 21:37:48,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 21:37:48,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 21:37:48,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 21:37:48,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 21:37:48,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 21:37:48,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 21:37:48,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 21:37:48,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 21:37:48,977 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 21:37:48,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 21:37:48,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 21:37:48,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 21:37:48,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 21:37:48,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 21:37:48,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 21:37:48,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 21:37:48,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 21:37:48,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 21:37:48,980 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 21:37:48,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 21:37:48,980 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 21:37:48,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 21:37:48,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 21:37:48,981 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 21:37:48,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 21:37:48,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:37:48,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 21:37:48,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 21:37:48,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 21:37:48,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 21:37:48,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 21:37:48,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 21:37:48,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 21:37:48,983 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 21:37:49,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 21:37:49,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 21:37:49,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 21:37:49,238 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 21:37:49,238 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 21:37:49,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-08-25 21:37:50,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 21:37:50,356 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 21:37:50,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-08-25 21:37:50,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c40ab11d/37b4d2ffa3244d858ed0c74822c6451c/FLAGebf0162e9 [2023-08-25 21:37:50,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c40ab11d/37b4d2ffa3244d858ed0c74822c6451c [2023-08-25 21:37:50,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 21:37:50,378 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 21:37:50,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 21:37:50,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 21:37:50,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 21:37:50,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a06b065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50, skipping insertion in model container [2023-08-25 21:37:50,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,394 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 21:37:50,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:37:50,565 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 21:37:50,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:37:50,613 INFO L206 MainTranslator]: Completed translation [2023-08-25 21:37:50,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50 WrapperNode [2023-08-25 21:37:50,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 21:37:50,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 21:37:50,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 21:37:50,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 21:37:50,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,681 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 489 [2023-08-25 21:37:50,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 21:37:50,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 21:37:50,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 21:37:50,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 21:37:50,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 21:37:50,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 21:37:50,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 21:37:50,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 21:37:50,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (1/1) ... [2023-08-25 21:37:50,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:37:50,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:37:50,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 21:37:50,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 21:37:50,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 21:37:50,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 21:37:50,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 21:37:50,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 21:37:50,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 21:37:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 21:37:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 21:37:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 21:37:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 21:37:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 21:37:50,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 21:37:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 21:37:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 21:37:50,780 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 21:37:50,872 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 21:37:50,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 21:37:51,376 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 21:37:51,383 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 21:37:51,384 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-25 21:37:51,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:37:51 BoogieIcfgContainer [2023-08-25 21:37:51,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 21:37:51,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 21:37:51,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 21:37:51,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 21:37:51,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:37:50" (1/3) ... [2023-08-25 21:37:51,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68411247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:37:51, skipping insertion in model container [2023-08-25 21:37:51,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:37:50" (2/3) ... [2023-08-25 21:37:51,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68411247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:37:51, skipping insertion in model container [2023-08-25 21:37:51,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:37:51" (3/3) ... [2023-08-25 21:37:51,390 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2023-08-25 21:37:51,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 21:37:51,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2023-08-25 21:37:51,401 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 21:37:51,555 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 21:37:51,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 590 places, 617 transitions, 1250 flow [2023-08-25 21:37:51,718 INFO L124 PetriNetUnfolderBase]: 34/615 cut-off events. [2023-08-25 21:37:51,718 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 21:37:51,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 615 events. 34/615 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1838 event pairs, 0 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 487. Up to 2 conditions per place. [2023-08-25 21:37:51,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 590 places, 617 transitions, 1250 flow [2023-08-25 21:37:51,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 579 places, 606 transitions, 1224 flow [2023-08-25 21:37:51,741 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 21:37:51,748 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 579 places, 606 transitions, 1224 flow [2023-08-25 21:37:51,750 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 579 places, 606 transitions, 1224 flow [2023-08-25 21:37:51,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 579 places, 606 transitions, 1224 flow [2023-08-25 21:37:51,819 INFO L124 PetriNetUnfolderBase]: 34/606 cut-off events. [2023-08-25 21:37:51,819 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 21:37:51,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 606 events. 34/606 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1820 event pairs, 0 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 487. Up to 2 conditions per place. [2023-08-25 21:37:51,842 INFO L119 LiptonReduction]: Number of co-enabled transitions 59800 [2023-08-25 21:37:59,827 INFO L134 LiptonReduction]: Checked pairs total: 241078 [2023-08-25 21:37:59,827 INFO L136 LiptonReduction]: Total number of compositions: 611 [2023-08-25 21:37:59,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 21:37:59,840 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1d8257f5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 21:37:59,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 165 error locations. [2023-08-25 21:37:59,841 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 21:37:59,841 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 21:37:59,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:37:59,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:37:59,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 21:37:59,842 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:37:59,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:37:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2452, now seen corresponding path program 1 times [2023-08-25 21:37:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:37:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059892781] [2023-08-25 21:37:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:37:59,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:37:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:37:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:37:59,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:37:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059892781] [2023-08-25 21:37:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059892781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:37:59,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:37:59,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 21:37:59,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396873072] [2023-08-25 21:37:59,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:37:59,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 21:37:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:37:59,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 21:37:59,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 21:37:59,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 1228 [2023-08-25 21:37:59,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 232 transitions, 476 flow. Second operand has 2 states, 2 states have (on average 595.5) internal successors, (1191), 2 states have internal predecessors, (1191), 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) [2023-08-25 21:37:59,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:37:59,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 1228 [2023-08-25 21:37:59,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:00,316 INFO L124 PetriNetUnfolderBase]: 1923/4659 cut-off events. [2023-08-25 21:38:00,316 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-08-25 21:38:00,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7800 conditions, 4659 events. 1923/4659 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 36429 event pairs, 1478 based on Foata normal form. 717/4823 useless extension candidates. Maximal degree in co-relation 6925. Up to 3057 conditions per place. [2023-08-25 21:38:00,340 INFO L140 encePairwiseOnDemand]: 1172/1228 looper letters, 87 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2023-08-25 21:38:00,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 176 transitions, 538 flow [2023-08-25 21:38:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 21:38:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 21:38:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1333 transitions. [2023-08-25 21:38:00,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5427524429967426 [2023-08-25 21:38:00,355 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1333 transitions. [2023-08-25 21:38:00,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1333 transitions. [2023-08-25 21:38:00,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:00,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1333 transitions. [2023-08-25 21:38:00,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 666.5) internal successors, (1333), 2 states have internal predecessors, (1333), 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) [2023-08-25 21:38:00,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1228.0) internal successors, (3684), 3 states have internal predecessors, (3684), 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) [2023-08-25 21:38:00,422 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1228.0) internal successors, (3684), 3 states have internal predecessors, (3684), 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) [2023-08-25 21:38:00,424 INFO L175 Difference]: Start difference. First operand has 220 places, 232 transitions, 476 flow. Second operand 2 states and 1333 transitions. [2023-08-25 21:38:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 176 transitions, 538 flow [2023-08-25 21:38:00,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 176 transitions, 530 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:38:00,431 INFO L231 Difference]: Finished difference. Result has 169 places, 176 transitions, 356 flow [2023-08-25 21:38:00,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=356, PETRI_PLACES=169, PETRI_TRANSITIONS=176} [2023-08-25 21:38:00,435 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -51 predicate places. [2023-08-25 21:38:00,435 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 176 transitions, 356 flow [2023-08-25 21:38:00,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 595.5) internal successors, (1191), 2 states have internal predecessors, (1191), 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) [2023-08-25 21:38:00,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:00,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 21:38:00,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 21:38:00,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:00,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 490402646, now seen corresponding path program 1 times [2023-08-25 21:38:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416761548] [2023-08-25 21:38:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:38:00,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416761548] [2023-08-25 21:38:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416761548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:00,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:00,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:38:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506663551] [2023-08-25 21:38:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:00,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:38:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:38:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:38:00,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 574 out of 1228 [2023-08-25 21:38:00,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 176 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 575.6666666666666) internal successors, (1727), 3 states have internal predecessors, (1727), 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) [2023-08-25 21:38:00,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:00,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 574 of 1228 [2023-08-25 21:38:00,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:00,864 INFO L124 PetriNetUnfolderBase]: 2123/4959 cut-off events. [2023-08-25 21:38:00,864 INFO L125 PetriNetUnfolderBase]: For 68/85 co-relation queries the response was YES. [2023-08-25 21:38:00,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8457 conditions, 4959 events. 2123/4959 cut-off events. For 68/85 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 37416 event pairs, 1056 based on Foata normal form. 1/4542 useless extension candidates. Maximal degree in co-relation 8454. Up to 3478 conditions per place. [2023-08-25 21:38:00,886 INFO L140 encePairwiseOnDemand]: 1220/1228 looper letters, 96 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-08-25 21:38:00,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 175 transitions, 551 flow [2023-08-25 21:38:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:38:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:38:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1826 transitions. [2023-08-25 21:38:00,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495656894679696 [2023-08-25 21:38:00,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1826 transitions. [2023-08-25 21:38:00,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1826 transitions. [2023-08-25 21:38:00,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:00,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1826 transitions. [2023-08-25 21:38:00,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 608.6666666666666) internal successors, (1826), 3 states have internal predecessors, (1826), 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) [2023-08-25 21:38:00,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:00,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:00,904 INFO L175 Difference]: Start difference. First operand has 169 places, 176 transitions, 356 flow. Second operand 3 states and 1826 transitions. [2023-08-25 21:38:00,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 175 transitions, 551 flow [2023-08-25 21:38:00,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 175 transitions, 551 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:38:00,907 INFO L231 Difference]: Finished difference. Result has 166 places, 172 transitions, 358 flow [2023-08-25 21:38:00,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=166, PETRI_TRANSITIONS=172} [2023-08-25 21:38:00,907 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -54 predicate places. [2023-08-25 21:38:00,908 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 172 transitions, 358 flow [2023-08-25 21:38:00,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 575.6666666666666) internal successors, (1727), 3 states have internal predecessors, (1727), 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) [2023-08-25 21:38:00,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:00,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:00,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 21:38:00,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:00,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1168477798, now seen corresponding path program 1 times [2023-08-25 21:38:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:00,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753141311] [2023-08-25 21:38:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:38:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753141311] [2023-08-25 21:38:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753141311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:00,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:00,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:38:00,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551576867] [2023-08-25 21:38:00,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:00,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:38:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:00,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:38:00,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:38:00,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 1228 [2023-08-25 21:38:00,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 172 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 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) [2023-08-25 21:38:00,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:00,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 1228 [2023-08-25 21:38:00,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:01,284 INFO L124 PetriNetUnfolderBase]: 1802/4517 cut-off events. [2023-08-25 21:38:01,284 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-25 21:38:01,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 4517 events. 1802/4517 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 34656 event pairs, 1542 based on Foata normal form. 0/4083 useless extension candidates. Maximal degree in co-relation 7611. Up to 3018 conditions per place. [2023-08-25 21:38:01,307 INFO L140 encePairwiseOnDemand]: 1217/1228 looper letters, 86 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2023-08-25 21:38:01,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 162 transitions, 512 flow [2023-08-25 21:38:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:38:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:38:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1765 transitions. [2023-08-25 21:38:01,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790988056460369 [2023-08-25 21:38:01,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1765 transitions. [2023-08-25 21:38:01,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1765 transitions. [2023-08-25 21:38:01,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:01,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1765 transitions. [2023-08-25 21:38:01,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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) [2023-08-25 21:38:01,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:01,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:01,321 INFO L175 Difference]: Start difference. First operand has 166 places, 172 transitions, 358 flow. Second operand 3 states and 1765 transitions. [2023-08-25 21:38:01,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 162 transitions, 512 flow [2023-08-25 21:38:01,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 162 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:38:01,324 INFO L231 Difference]: Finished difference. Result has 158 places, 162 transitions, 340 flow [2023-08-25 21:38:01,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=158, PETRI_TRANSITIONS=162} [2023-08-25 21:38:01,325 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -62 predicate places. [2023-08-25 21:38:01,325 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 340 flow [2023-08-25 21:38:01,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 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) [2023-08-25 21:38:01,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:01,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:01,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 21:38:01,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:01,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1405656490, now seen corresponding path program 1 times [2023-08-25 21:38:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050325646] [2023-08-25 21:38:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:38:01,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050325646] [2023-08-25 21:38:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050325646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:38:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372067773] [2023-08-25 21:38:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:01,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:38:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:01,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:38:01,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:38:01,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 1228 [2023-08-25 21:38:01,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 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) [2023-08-25 21:38:01,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:01,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 1228 [2023-08-25 21:38:01,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:01,979 INFO L124 PetriNetUnfolderBase]: 4162/8065 cut-off events. [2023-08-25 21:38:01,980 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2023-08-25 21:38:01,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15353 conditions, 8065 events. 4162/8065 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 55707 event pairs, 1372 based on Foata normal form. 0/7149 useless extension candidates. Maximal degree in co-relation 15348. Up to 4718 conditions per place. [2023-08-25 21:38:02,008 INFO L140 encePairwiseOnDemand]: 1217/1228 looper letters, 189 selfloop transitions, 7 changer transitions 0/234 dead transitions. [2023-08-25 21:38:02,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 234 transitions, 878 flow [2023-08-25 21:38:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:38:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:38:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2023-08-25 21:38:02,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46389793702497284 [2023-08-25 21:38:02,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1709 transitions. [2023-08-25 21:38:02,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1709 transitions. [2023-08-25 21:38:02,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:02,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1709 transitions. [2023-08-25 21:38:02,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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) [2023-08-25 21:38:02,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:02,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:02,021 INFO L175 Difference]: Start difference. First operand has 158 places, 162 transitions, 340 flow. Second operand 3 states and 1709 transitions. [2023-08-25 21:38:02,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 234 transitions, 878 flow [2023-08-25 21:38:02,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 234 transitions, 877 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:38:02,024 INFO L231 Difference]: Finished difference. Result has 160 places, 168 transitions, 392 flow [2023-08-25 21:38:02,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=160, PETRI_TRANSITIONS=168} [2023-08-25 21:38:02,025 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -60 predicate places. [2023-08-25 21:38:02,025 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 168 transitions, 392 flow [2023-08-25 21:38:02,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 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) [2023-08-25 21:38:02,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:02,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:02,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 21:38:02,026 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:02,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash -568963027, now seen corresponding path program 1 times [2023-08-25 21:38:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001962381] [2023-08-25 21:38:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:38:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001962381] [2023-08-25 21:38:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001962381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:02,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:38:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321251392] [2023-08-25 21:38:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:02,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:38:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:02,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:38:02,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:38:02,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 577 out of 1228 [2023-08-25 21:38:02,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 579.0) internal successors, (1737), 3 states have internal predecessors, (1737), 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) [2023-08-25 21:38:02,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:02,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 577 of 1228 [2023-08-25 21:38:02,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:02,566 INFO L124 PetriNetUnfolderBase]: 2712/6617 cut-off events. [2023-08-25 21:38:02,568 INFO L125 PetriNetUnfolderBase]: For 317/317 co-relation queries the response was YES. [2023-08-25 21:38:02,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11738 conditions, 6617 events. 2712/6617 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 51942 event pairs, 2397 based on Foata normal form. 0/6179 useless extension candidates. Maximal degree in co-relation 11732. Up to 4606 conditions per place. [2023-08-25 21:38:02,594 INFO L140 encePairwiseOnDemand]: 1225/1228 looper letters, 92 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2023-08-25 21:38:02,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 169 transitions, 582 flow [2023-08-25 21:38:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:38:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:38:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1820 transitions. [2023-08-25 21:38:02,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494028230184582 [2023-08-25 21:38:02,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1820 transitions. [2023-08-25 21:38:02,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1820 transitions. [2023-08-25 21:38:02,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:02,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1820 transitions. [2023-08-25 21:38:02,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 606.6666666666666) internal successors, (1820), 3 states have internal predecessors, (1820), 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) [2023-08-25 21:38:02,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:02,606 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:02,607 INFO L175 Difference]: Start difference. First operand has 160 places, 168 transitions, 392 flow. Second operand 3 states and 1820 transitions. [2023-08-25 21:38:02,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 169 transitions, 582 flow [2023-08-25 21:38:02,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 169 transitions, 575 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:38:02,609 INFO L231 Difference]: Finished difference. Result has 162 places, 169 transitions, 397 flow [2023-08-25 21:38:02,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=162, PETRI_TRANSITIONS=169} [2023-08-25 21:38:02,610 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -58 predicate places. [2023-08-25 21:38:02,610 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 169 transitions, 397 flow [2023-08-25 21:38:02,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 579.0) internal successors, (1737), 3 states have internal predecessors, (1737), 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) [2023-08-25 21:38:02,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:02,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:02,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 21:38:02,611 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:02,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash -13156322, now seen corresponding path program 1 times [2023-08-25 21:38:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:02,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536444577] [2023-08-25 21:38:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:02,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:02,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536444577] [2023-08-25 21:38:02,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536444577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:02,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:02,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:38:02,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937453675] [2023-08-25 21:38:02,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:02,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:02,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:02,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:02,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 1228 [2023-08-25 21:38:02,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 512.8333333333334) internal successors, (3077), 6 states have internal predecessors, (3077), 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) [2023-08-25 21:38:02,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:02,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 1228 [2023-08-25 21:38:02,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:05,709 INFO L124 PetriNetUnfolderBase]: 24145/38848 cut-off events. [2023-08-25 21:38:05,709 INFO L125 PetriNetUnfolderBase]: For 912/912 co-relation queries the response was YES. [2023-08-25 21:38:05,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78527 conditions, 38848 events. 24145/38848 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 275449 event pairs, 1860 based on Foata normal form. 0/35910 useless extension candidates. Maximal degree in co-relation 78520. Up to 14902 conditions per place. [2023-08-25 21:38:05,878 INFO L140 encePairwiseOnDemand]: 1223/1228 looper letters, 637 selfloop transitions, 4 changer transitions 0/664 dead transitions. [2023-08-25 21:38:05,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 664 transitions, 2797 flow [2023-08-25 21:38:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3677 transitions. [2023-08-25 21:38:05,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990499457111835 [2023-08-25 21:38:05,885 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3677 transitions. [2023-08-25 21:38:05,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3677 transitions. [2023-08-25 21:38:05,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:05,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3677 transitions. [2023-08-25 21:38:05,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 612.8333333333334) internal successors, (3677), 6 states have internal predecessors, (3677), 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) [2023-08-25 21:38:05,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:05,910 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:05,910 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 397 flow. Second operand 6 states and 3677 transitions. [2023-08-25 21:38:05,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 664 transitions, 2797 flow [2023-08-25 21:38:05,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 664 transitions, 2793 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 21:38:05,921 INFO L231 Difference]: Finished difference. Result has 165 places, 168 transitions, 399 flow [2023-08-25 21:38:05,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=165, PETRI_TRANSITIONS=168} [2023-08-25 21:38:05,923 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -55 predicate places. [2023-08-25 21:38:05,923 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 168 transitions, 399 flow [2023-08-25 21:38:05,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 512.8333333333334) internal successors, (3077), 6 states have internal predecessors, (3077), 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) [2023-08-25 21:38:05,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:05,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:05,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 21:38:05,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:05,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1363847651, now seen corresponding path program 1 times [2023-08-25 21:38:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:05,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147798208] [2023-08-25 21:38:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147798208] [2023-08-25 21:38:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147798208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:38:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964475606] [2023-08-25 21:38:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:38:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:38:05,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:38:05,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 21:38:05,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 168 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 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) [2023-08-25 21:38:05,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:05,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 21:38:05,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:06,500 INFO L124 PetriNetUnfolderBase]: 3736/8089 cut-off events. [2023-08-25 21:38:06,500 INFO L125 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2023-08-25 21:38:06,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15807 conditions, 8089 events. 3736/8089 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 59869 event pairs, 802 based on Foata normal form. 0/7443 useless extension candidates. Maximal degree in co-relation 15800. Up to 5486 conditions per place. [2023-08-25 21:38:06,532 INFO L140 encePairwiseOnDemand]: 1212/1228 looper letters, 128 selfloop transitions, 6 changer transitions 0/195 dead transitions. [2023-08-25 21:38:06,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 195 transitions, 726 flow [2023-08-25 21:38:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:38:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:38:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1823 transitions. [2023-08-25 21:38:06,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494842562432139 [2023-08-25 21:38:06,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1823 transitions. [2023-08-25 21:38:06,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1823 transitions. [2023-08-25 21:38:06,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:06,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1823 transitions. [2023-08-25 21:38:06,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 607.6666666666666) internal successors, (1823), 3 states have internal predecessors, (1823), 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) [2023-08-25 21:38:06,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:06,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:06,543 INFO L175 Difference]: Start difference. First operand has 165 places, 168 transitions, 399 flow. Second operand 3 states and 1823 transitions. [2023-08-25 21:38:06,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 195 transitions, 726 flow [2023-08-25 21:38:06,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 195 transitions, 717 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:38:06,548 INFO L231 Difference]: Finished difference. Result has 154 places, 164 transitions, 414 flow [2023-08-25 21:38:06,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=154, PETRI_TRANSITIONS=164} [2023-08-25 21:38:06,549 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -66 predicate places. [2023-08-25 21:38:06,549 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 164 transitions, 414 flow [2023-08-25 21:38:06,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 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) [2023-08-25 21:38:06,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:06,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:06,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 21:38:06,550 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:06,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2105533571, now seen corresponding path program 1 times [2023-08-25 21:38:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076230612] [2023-08-25 21:38:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:06,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:06,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076230612] [2023-08-25 21:38:06,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076230612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:06,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:06,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:38:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100906005] [2023-08-25 21:38:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:06,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:06,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 1228 [2023-08-25 21:38:06,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 164 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 502.3333333333333) internal successors, (3014), 6 states have internal predecessors, (3014), 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) [2023-08-25 21:38:06,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:06,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 1228 [2023-08-25 21:38:06,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:10,054 INFO L124 PetriNetUnfolderBase]: 25867/41157 cut-off events. [2023-08-25 21:38:10,054 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2023-08-25 21:38:10,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86689 conditions, 41157 events. 25867/41157 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 273619 event pairs, 16162 based on Foata normal form. 0/38184 useless extension candidates. Maximal degree in co-relation 86682. Up to 29461 conditions per place. [2023-08-25 21:38:10,196 INFO L140 encePairwiseOnDemand]: 1222/1228 looper letters, 619 selfloop transitions, 5 changer transitions 0/639 dead transitions. [2023-08-25 21:38:10,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 639 transitions, 2780 flow [2023-08-25 21:38:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3590 transitions. [2023-08-25 21:38:10,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48724212812160694 [2023-08-25 21:38:10,203 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3590 transitions. [2023-08-25 21:38:10,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3590 transitions. [2023-08-25 21:38:10,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:10,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3590 transitions. [2023-08-25 21:38:10,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 598.3333333333334) internal successors, (3590), 6 states have internal predecessors, (3590), 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) [2023-08-25 21:38:10,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:10,215 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:10,215 INFO L175 Difference]: Start difference. First operand has 154 places, 164 transitions, 414 flow. Second operand 6 states and 3590 transitions. [2023-08-25 21:38:10,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 639 transitions, 2780 flow [2023-08-25 21:38:10,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 639 transitions, 2780 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:38:10,222 INFO L231 Difference]: Finished difference. Result has 158 places, 163 transitions, 422 flow [2023-08-25 21:38:10,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=158, PETRI_TRANSITIONS=163} [2023-08-25 21:38:10,223 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -62 predicate places. [2023-08-25 21:38:10,223 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 163 transitions, 422 flow [2023-08-25 21:38:10,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 502.3333333333333) internal successors, (3014), 6 states have internal predecessors, (3014), 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) [2023-08-25 21:38:10,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:10,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:10,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 21:38:10,224 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:10,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1853917298, now seen corresponding path program 1 times [2023-08-25 21:38:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:10,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208176427] [2023-08-25 21:38:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:10,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208176427] [2023-08-25 21:38:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208176427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:10,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:38:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648793286] [2023-08-25 21:38:10,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:10,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:10,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 1228 [2023-08-25 21:38:10,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 163 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 478.6666666666667) internal successors, (2872), 6 states have internal predecessors, (2872), 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) [2023-08-25 21:38:10,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:10,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 1228 [2023-08-25 21:38:10,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:12,814 INFO L124 PetriNetUnfolderBase]: 23287/37548 cut-off events. [2023-08-25 21:38:12,814 INFO L125 PetriNetUnfolderBase]: For 4293/4293 co-relation queries the response was YES. [2023-08-25 21:38:12,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83389 conditions, 37548 events. 23287/37548 cut-off events. For 4293/4293 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 247194 event pairs, 12912 based on Foata normal form. 910/36292 useless extension candidates. Maximal degree in co-relation 83381. Up to 22897 conditions per place. [2023-08-25 21:38:12,951 INFO L140 encePairwiseOnDemand]: 1173/1228 looper letters, 179 selfloop transitions, 52 changer transitions 0/246 dead transitions. [2023-08-25 21:38:12,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 246 transitions, 1098 flow [2023-08-25 21:38:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3085 transitions. [2023-08-25 21:38:12,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4187024972855592 [2023-08-25 21:38:12,957 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3085 transitions. [2023-08-25 21:38:12,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3085 transitions. [2023-08-25 21:38:12,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:12,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3085 transitions. [2023-08-25 21:38:12,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 514.1666666666666) internal successors, (3085), 6 states have internal predecessors, (3085), 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) [2023-08-25 21:38:12,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:12,969 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:12,969 INFO L175 Difference]: Start difference. First operand has 158 places, 163 transitions, 422 flow. Second operand 6 states and 3085 transitions. [2023-08-25 21:38:12,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 246 transitions, 1098 flow [2023-08-25 21:38:12,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 246 transitions, 1048 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 21:38:12,985 INFO L231 Difference]: Finished difference. Result has 149 places, 154 transitions, 498 flow [2023-08-25 21:38:12,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=149, PETRI_TRANSITIONS=154} [2023-08-25 21:38:12,986 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -71 predicate places. [2023-08-25 21:38:12,986 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 154 transitions, 498 flow [2023-08-25 21:38:12,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 478.6666666666667) internal successors, (2872), 6 states have internal predecessors, (2872), 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) [2023-08-25 21:38:12,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:12,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:12,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 21:38:12,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:12,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2107011209, now seen corresponding path program 1 times [2023-08-25 21:38:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:12,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526106389] [2023-08-25 21:38:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:13,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526106389] [2023-08-25 21:38:13,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526106389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:13,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:13,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:38:13,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126161989] [2023-08-25 21:38:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:13,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:13,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:13,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 1228 [2023-08-25 21:38:13,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 154 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 514.0) internal successors, (3084), 6 states have internal predecessors, (3084), 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) [2023-08-25 21:38:13,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:13,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 1228 [2023-08-25 21:38:13,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:16,146 INFO L124 PetriNetUnfolderBase]: 23113/37173 cut-off events. [2023-08-25 21:38:16,147 INFO L125 PetriNetUnfolderBase]: For 1017/1017 co-relation queries the response was YES. [2023-08-25 21:38:16,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84903 conditions, 37173 events. 23113/37173 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 243901 event pairs, 19966 based on Foata normal form. 0/35179 useless extension candidates. Maximal degree in co-relation 84895. Up to 34309 conditions per place. [2023-08-25 21:38:16,266 INFO L140 encePairwiseOnDemand]: 1223/1228 looper letters, 554 selfloop transitions, 4 changer transitions 8/581 dead transitions. [2023-08-25 21:38:16,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 581 transitions, 3108 flow [2023-08-25 21:38:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3582 transitions. [2023-08-25 21:38:16,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48615635179153094 [2023-08-25 21:38:16,272 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3582 transitions. [2023-08-25 21:38:16,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3582 transitions. [2023-08-25 21:38:16,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:16,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3582 transitions. [2023-08-25 21:38:16,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 597.0) internal successors, (3582), 6 states have internal predecessors, (3582), 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) [2023-08-25 21:38:16,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:16,283 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:16,283 INFO L175 Difference]: Start difference. First operand has 149 places, 154 transitions, 498 flow. Second operand 6 states and 3582 transitions. [2023-08-25 21:38:16,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 581 transitions, 3108 flow [2023-08-25 21:38:16,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 581 transitions, 2588 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 21:38:16,329 INFO L231 Difference]: Finished difference. Result has 148 places, 153 transitions, 400 flow [2023-08-25 21:38:16,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=148, PETRI_TRANSITIONS=153} [2023-08-25 21:38:16,329 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -72 predicate places. [2023-08-25 21:38:16,329 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 153 transitions, 400 flow [2023-08-25 21:38:16,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 514.0) internal successors, (3084), 6 states have internal predecessors, (3084), 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) [2023-08-25 21:38:16,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:16,330 INFO L208 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] [2023-08-25 21:38:16,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 21:38:16,330 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:16,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:16,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1842654047, now seen corresponding path program 1 times [2023-08-25 21:38:16,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:16,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489322621] [2023-08-25 21:38:16,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489322621] [2023-08-25 21:38:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489322621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:16,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:16,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:38:16,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869256507] [2023-08-25 21:38:16,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:16,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:38:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:38:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:38:16,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 21:38:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 153 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 566.5) internal successors, (2266), 4 states have internal predecessors, (2266), 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) [2023-08-25 21:38:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 21:38:16,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:16,971 INFO L124 PetriNetUnfolderBase]: 2733/5960 cut-off events. [2023-08-25 21:38:16,971 INFO L125 PetriNetUnfolderBase]: For 417/425 co-relation queries the response was YES. [2023-08-25 21:38:16,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11472 conditions, 5960 events. 2733/5960 cut-off events. For 417/425 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 40971 event pairs, 1621 based on Foata normal form. 30/5614 useless extension candidates. Maximal degree in co-relation 11464. Up to 3262 conditions per place. [2023-08-25 21:38:16,987 INFO L140 encePairwiseOnDemand]: 1222/1228 looper letters, 132 selfloop transitions, 5 changer transitions 0/190 dead transitions. [2023-08-25 21:38:16,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 190 transitions, 750 flow [2023-08-25 21:38:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 21:38:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 21:38:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2382 transitions. [2023-08-25 21:38:16,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48493485342019543 [2023-08-25 21:38:16,992 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2382 transitions. [2023-08-25 21:38:16,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2382 transitions. [2023-08-25 21:38:16,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:16,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2382 transitions. [2023-08-25 21:38:16,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 595.5) internal successors, (2382), 4 states have internal predecessors, (2382), 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) [2023-08-25 21:38:17,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 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) [2023-08-25 21:38:17,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 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) [2023-08-25 21:38:17,002 INFO L175 Difference]: Start difference. First operand has 148 places, 153 transitions, 400 flow. Second operand 4 states and 2382 transitions. [2023-08-25 21:38:17,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 190 transitions, 750 flow [2023-08-25 21:38:17,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 190 transitions, 733 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-25 21:38:17,005 INFO L231 Difference]: Finished difference. Result has 149 places, 152 transitions, 399 flow [2023-08-25 21:38:17,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=149, PETRI_TRANSITIONS=152} [2023-08-25 21:38:17,006 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -71 predicate places. [2023-08-25 21:38:17,006 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 152 transitions, 399 flow [2023-08-25 21:38:17,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 566.5) internal successors, (2266), 4 states have internal predecessors, (2266), 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) [2023-08-25 21:38:17,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:17,006 INFO L208 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] [2023-08-25 21:38:17,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 21:38:17,007 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:17,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:17,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1689950141, now seen corresponding path program 1 times [2023-08-25 21:38:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:17,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734837694] [2023-08-25 21:38:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:17,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:17,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734837694] [2023-08-25 21:38:17,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734837694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:17,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:17,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:38:17,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518459488] [2023-08-25 21:38:17,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:17,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:38:17,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:38:17,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:38:17,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 21:38:17,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 152 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 568.0) internal successors, (2272), 4 states have internal predecessors, (2272), 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) [2023-08-25 21:38:17,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:17,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 21:38:17,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:17,663 INFO L124 PetriNetUnfolderBase]: 2453/5414 cut-off events. [2023-08-25 21:38:17,663 INFO L125 PetriNetUnfolderBase]: For 513/521 co-relation queries the response was YES. [2023-08-25 21:38:17,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10492 conditions, 5414 events. 2453/5414 cut-off events. For 513/521 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 36441 event pairs, 1578 based on Foata normal form. 30/5093 useless extension candidates. Maximal degree in co-relation 10482. Up to 3240 conditions per place. [2023-08-25 21:38:17,683 INFO L140 encePairwiseOnDemand]: 1223/1228 looper letters, 124 selfloop transitions, 4 changer transitions 0/181 dead transitions. [2023-08-25 21:38:17,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 181 transitions, 711 flow [2023-08-25 21:38:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 21:38:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 21:38:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2374 transitions. [2023-08-25 21:38:17,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4833061889250814 [2023-08-25 21:38:17,687 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2374 transitions. [2023-08-25 21:38:17,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2374 transitions. [2023-08-25 21:38:17,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:17,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2374 transitions. [2023-08-25 21:38:17,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 593.5) internal successors, (2374), 4 states have internal predecessors, (2374), 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) [2023-08-25 21:38:17,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 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) [2023-08-25 21:38:17,695 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 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) [2023-08-25 21:38:17,695 INFO L175 Difference]: Start difference. First operand has 149 places, 152 transitions, 399 flow. Second operand 4 states and 2374 transitions. [2023-08-25 21:38:17,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 181 transitions, 711 flow [2023-08-25 21:38:17,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 181 transitions, 700 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-25 21:38:17,698 INFO L231 Difference]: Finished difference. Result has 152 places, 149 transitions, 386 flow [2023-08-25 21:38:17,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=152, PETRI_TRANSITIONS=149} [2023-08-25 21:38:17,699 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -68 predicate places. [2023-08-25 21:38:17,699 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 149 transitions, 386 flow [2023-08-25 21:38:17,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 568.0) internal successors, (2272), 4 states have internal predecessors, (2272), 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) [2023-08-25 21:38:17,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:17,700 INFO L208 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] [2023-08-25 21:38:17,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 21:38:17,700 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:17,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1297942636, now seen corresponding path program 1 times [2023-08-25 21:38:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771069932] [2023-08-25 21:38:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:17,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771069932] [2023-08-25 21:38:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771069932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:17,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:17,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 21:38:17,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883331512] [2023-08-25 21:38:17,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:17,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-25 21:38:17,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-25 21:38:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-25 21:38:17,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:17,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 149 transitions, 386 flow. Second operand has 7 states, 7 states have (on average 562.7142857142857) internal successors, (3939), 7 states have internal predecessors, (3939), 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) [2023-08-25 21:38:17,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:17,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:17,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:19,502 INFO L124 PetriNetUnfolderBase]: 5703/11837 cut-off events. [2023-08-25 21:38:19,502 INFO L125 PetriNetUnfolderBase]: For 1165/1200 co-relation queries the response was YES. [2023-08-25 21:38:19,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22736 conditions, 11837 events. 5703/11837 cut-off events. For 1165/1200 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 85975 event pairs, 2061 based on Foata normal form. 43/11090 useless extension candidates. Maximal degree in co-relation 22725. Up to 2944 conditions per place. [2023-08-25 21:38:19,548 INFO L140 encePairwiseOnDemand]: 1219/1228 looper letters, 382 selfloop transitions, 25 changer transitions 2/461 dead transitions. [2023-08-25 21:38:19,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 461 transitions, 1956 flow [2023-08-25 21:38:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 21:38:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 21:38:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7116 transitions. [2023-08-25 21:38:19,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828990228013029 [2023-08-25 21:38:19,556 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7116 transitions. [2023-08-25 21:38:19,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7116 transitions. [2023-08-25 21:38:19,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:19,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7116 transitions. [2023-08-25 21:38:19,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 593.0) internal successors, (7116), 12 states have internal predecessors, (7116), 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) [2023-08-25 21:38:19,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1228.0) internal successors, (15964), 13 states have internal predecessors, (15964), 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) [2023-08-25 21:38:19,574 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1228.0) internal successors, (15964), 13 states have internal predecessors, (15964), 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) [2023-08-25 21:38:19,574 INFO L175 Difference]: Start difference. First operand has 152 places, 149 transitions, 386 flow. Second operand 12 states and 7116 transitions. [2023-08-25 21:38:19,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 461 transitions, 1956 flow [2023-08-25 21:38:19,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 461 transitions, 1934 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 21:38:19,580 INFO L231 Difference]: Finished difference. Result has 166 places, 169 transitions, 549 flow [2023-08-25 21:38:19,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=549, PETRI_PLACES=166, PETRI_TRANSITIONS=169} [2023-08-25 21:38:19,581 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -54 predicate places. [2023-08-25 21:38:19,581 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 169 transitions, 549 flow [2023-08-25 21:38:19,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 562.7142857142857) internal successors, (3939), 7 states have internal predecessors, (3939), 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) [2023-08-25 21:38:19,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:19,582 INFO L208 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] [2023-08-25 21:38:19,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 21:38:19,582 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:19,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1703953979, now seen corresponding path program 1 times [2023-08-25 21:38:19,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:19,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896930113] [2023-08-25 21:38:19,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896930113] [2023-08-25 21:38:19,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896930113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:19,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:19,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:38:19,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873139101] [2023-08-25 21:38:19,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:19,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:38:19,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:19,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:38:19,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:38:19,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:19,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 169 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 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) [2023-08-25 21:38:19,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:19,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:19,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:21,307 INFO L124 PetriNetUnfolderBase]: 5710/12232 cut-off events. [2023-08-25 21:38:21,308 INFO L125 PetriNetUnfolderBase]: For 8458/8499 co-relation queries the response was YES. [2023-08-25 21:38:21,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26549 conditions, 12232 events. 5710/12232 cut-off events. For 8458/8499 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 91150 event pairs, 3358 based on Foata normal form. 14/11816 useless extension candidates. Maximal degree in co-relation 26532. Up to 4886 conditions per place. [2023-08-25 21:38:21,369 INFO L140 encePairwiseOnDemand]: 1222/1228 looper letters, 274 selfloop transitions, 15 changer transitions 3/344 dead transitions. [2023-08-25 21:38:21,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 344 transitions, 1603 flow [2023-08-25 21:38:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:38:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:38:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3053 transitions. [2023-08-25 21:38:21,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49723127035830617 [2023-08-25 21:38:21,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3053 transitions. [2023-08-25 21:38:21,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3053 transitions. [2023-08-25 21:38:21,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:21,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3053 transitions. [2023-08-25 21:38:21,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 610.6) internal successors, (3053), 5 states have internal predecessors, (3053), 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) [2023-08-25 21:38:21,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 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) [2023-08-25 21:38:21,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 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) [2023-08-25 21:38:21,380 INFO L175 Difference]: Start difference. First operand has 166 places, 169 transitions, 549 flow. Second operand 5 states and 3053 transitions. [2023-08-25 21:38:21,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 344 transitions, 1603 flow [2023-08-25 21:38:21,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 344 transitions, 1587 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:38:21,409 INFO L231 Difference]: Finished difference. Result has 170 places, 171 transitions, 604 flow [2023-08-25 21:38:21,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=604, PETRI_PLACES=170, PETRI_TRANSITIONS=171} [2023-08-25 21:38:21,410 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -50 predicate places. [2023-08-25 21:38:21,410 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 171 transitions, 604 flow [2023-08-25 21:38:21,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 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) [2023-08-25 21:38:21,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:21,410 INFO L208 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] [2023-08-25 21:38:21,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 21:38:21,411 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:21,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:21,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1809565797, now seen corresponding path program 2 times [2023-08-25 21:38:21,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:21,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941053998] [2023-08-25 21:38:21,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:21,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941053998] [2023-08-25 21:38:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941053998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:21,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:38:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959366464] [2023-08-25 21:38:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:21,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:38:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:38:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:38:21,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:21,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 604 flow. Second operand has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 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) [2023-08-25 21:38:21,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:21,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:21,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:22,807 INFO L124 PetriNetUnfolderBase]: 6110/13037 cut-off events. [2023-08-25 21:38:22,807 INFO L125 PetriNetUnfolderBase]: For 12154/12257 co-relation queries the response was YES. [2023-08-25 21:38:22,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29600 conditions, 13037 events. 6110/13037 cut-off events. For 12154/12257 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 97203 event pairs, 3584 based on Foata normal form. 30/12611 useless extension candidates. Maximal degree in co-relation 29580. Up to 4918 conditions per place. [2023-08-25 21:38:22,870 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 225 selfloop transitions, 19 changer transitions 1/297 dead transitions. [2023-08-25 21:38:22,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 297 transitions, 1458 flow [2023-08-25 21:38:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:38:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:38:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3007 transitions. [2023-08-25 21:38:22,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897394136807818 [2023-08-25 21:38:22,874 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3007 transitions. [2023-08-25 21:38:22,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3007 transitions. [2023-08-25 21:38:22,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:22,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3007 transitions. [2023-08-25 21:38:22,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 601.4) internal successors, (3007), 5 states have internal predecessors, (3007), 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) [2023-08-25 21:38:22,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 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) [2023-08-25 21:38:22,880 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 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) [2023-08-25 21:38:22,880 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 604 flow. Second operand 5 states and 3007 transitions. [2023-08-25 21:38:22,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 297 transitions, 1458 flow [2023-08-25 21:38:22,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 297 transitions, 1446 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:38:22,913 INFO L231 Difference]: Finished difference. Result has 175 places, 177 transitions, 701 flow [2023-08-25 21:38:22,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=175, PETRI_TRANSITIONS=177} [2023-08-25 21:38:22,914 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -45 predicate places. [2023-08-25 21:38:22,914 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 177 transitions, 701 flow [2023-08-25 21:38:22,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 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) [2023-08-25 21:38:22,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:22,914 INFO L208 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] [2023-08-25 21:38:22,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 21:38:22,914 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:22,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -573154303, now seen corresponding path program 3 times [2023-08-25 21:38:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32799214] [2023-08-25 21:38:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32799214] [2023-08-25 21:38:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32799214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 21:38:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363184246] [2023-08-25 21:38:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:23,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:23,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:23,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 21:38:23,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 177 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 566.8333333333334) internal successors, (3401), 6 states have internal predecessors, (3401), 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) [2023-08-25 21:38:23,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:23,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 21:38:23,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:24,083 INFO L124 PetriNetUnfolderBase]: 5688/12199 cut-off events. [2023-08-25 21:38:24,083 INFO L125 PetriNetUnfolderBase]: For 11451/11565 co-relation queries the response was YES. [2023-08-25 21:38:24,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27882 conditions, 12199 events. 5688/12199 cut-off events. For 11451/11565 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 90516 event pairs, 2845 based on Foata normal form. 44/11824 useless extension candidates. Maximal degree in co-relation 27860. Up to 5653 conditions per place. [2023-08-25 21:38:24,148 INFO L140 encePairwiseOnDemand]: 1219/1228 looper letters, 165 selfloop transitions, 20 changer transitions 0/242 dead transitions. [2023-08-25 21:38:24,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 242 transitions, 1323 flow [2023-08-25 21:38:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3528 transitions. [2023-08-25 21:38:24,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788273615635179 [2023-08-25 21:38:24,153 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3528 transitions. [2023-08-25 21:38:24,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3528 transitions. [2023-08-25 21:38:24,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:24,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3528 transitions. [2023-08-25 21:38:24,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 588.0) internal successors, (3528), 6 states have internal predecessors, (3528), 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) [2023-08-25 21:38:24,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:24,161 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:24,161 INFO L175 Difference]: Start difference. First operand has 175 places, 177 transitions, 701 flow. Second operand 6 states and 3528 transitions. [2023-08-25 21:38:24,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 242 transitions, 1323 flow [2023-08-25 21:38:24,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 242 transitions, 1307 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 21:38:24,189 INFO L231 Difference]: Finished difference. Result has 181 places, 179 transitions, 754 flow [2023-08-25 21:38:24,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=181, PETRI_TRANSITIONS=179} [2023-08-25 21:38:24,190 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -39 predicate places. [2023-08-25 21:38:24,190 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 179 transitions, 754 flow [2023-08-25 21:38:24,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 566.8333333333334) internal successors, (3401), 6 states have internal predecessors, (3401), 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) [2023-08-25 21:38:24,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:24,191 INFO L208 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] [2023-08-25 21:38:24,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 21:38:24,191 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:24,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 664924409, now seen corresponding path program 1 times [2023-08-25 21:38:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611949916] [2023-08-25 21:38:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:24,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:24,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611949916] [2023-08-25 21:38:24,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611949916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:24,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:24,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 21:38:24,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293303559] [2023-08-25 21:38:24,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:24,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:24,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:24,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:24,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:24,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:24,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 179 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:24,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:24,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:24,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:25,910 INFO L124 PetriNetUnfolderBase]: 6637/13990 cut-off events. [2023-08-25 21:38:25,910 INFO L125 PetriNetUnfolderBase]: For 14965/15099 co-relation queries the response was YES. [2023-08-25 21:38:25,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32584 conditions, 13990 events. 6637/13990 cut-off events. For 14965/15099 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 104743 event pairs, 3596 based on Foata normal form. 71/13638 useless extension candidates. Maximal degree in co-relation 32561. Up to 4938 conditions per place. [2023-08-25 21:38:25,990 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 256 selfloop transitions, 21 changer transitions 0/329 dead transitions. [2023-08-25 21:38:25,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 329 transitions, 1727 flow [2023-08-25 21:38:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3593 transitions. [2023-08-25 21:38:25,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764929424538545 [2023-08-25 21:38:25,995 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3593 transitions. [2023-08-25 21:38:25,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3593 transitions. [2023-08-25 21:38:25,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:25,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3593 transitions. [2023-08-25 21:38:25,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 598.8333333333334) internal successors, (3593), 6 states have internal predecessors, (3593), 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) [2023-08-25 21:38:26,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:26,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:26,003 INFO L175 Difference]: Start difference. First operand has 181 places, 179 transitions, 754 flow. Second operand 6 states and 3593 transitions. [2023-08-25 21:38:26,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 329 transitions, 1727 flow [2023-08-25 21:38:26,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 329 transitions, 1691 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:38:26,054 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 808 flow [2023-08-25 21:38:26,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2023-08-25 21:38:26,054 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -36 predicate places. [2023-08-25 21:38:26,055 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 808 flow [2023-08-25 21:38:26,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:26,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:26,055 INFO L208 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] [2023-08-25 21:38:26,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 21:38:26,055 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:26,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1440772431, now seen corresponding path program 2 times [2023-08-25 21:38:26,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:26,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137095602] [2023-08-25 21:38:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137095602] [2023-08-25 21:38:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137095602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:38:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962035034] [2023-08-25 21:38:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:26,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:38:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:26,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:38:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:38:26,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:26,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 808 flow. Second operand has 5 states, 5 states have (on average 566.0) internal successors, (2830), 5 states have internal predecessors, (2830), 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) [2023-08-25 21:38:26,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:26,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:26,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:27,465 INFO L124 PetriNetUnfolderBase]: 6373/13353 cut-off events. [2023-08-25 21:38:27,465 INFO L125 PetriNetUnfolderBase]: For 16138/16234 co-relation queries the response was YES. [2023-08-25 21:38:27,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31762 conditions, 13353 events. 6373/13353 cut-off events. For 16138/16234 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 98473 event pairs, 4344 based on Foata normal form. 44/12963 useless extension candidates. Maximal degree in co-relation 31736. Up to 8635 conditions per place. [2023-08-25 21:38:27,514 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 165 selfloop transitions, 17 changer transitions 1/235 dead transitions. [2023-08-25 21:38:27,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 235 transitions, 1315 flow [2023-08-25 21:38:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:38:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:38:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2949 transitions. [2023-08-25 21:38:27,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4802931596091205 [2023-08-25 21:38:27,518 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2949 transitions. [2023-08-25 21:38:27,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2949 transitions. [2023-08-25 21:38:27,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:27,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2949 transitions. [2023-08-25 21:38:27,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 589.8) internal successors, (2949), 5 states have internal predecessors, (2949), 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) [2023-08-25 21:38:27,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 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) [2023-08-25 21:38:27,523 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 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) [2023-08-25 21:38:27,523 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 808 flow. Second operand 5 states and 2949 transitions. [2023-08-25 21:38:27,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 235 transitions, 1315 flow [2023-08-25 21:38:27,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 235 transitions, 1283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:38:27,553 INFO L231 Difference]: Finished difference. Result has 186 places, 181 transitions, 798 flow [2023-08-25 21:38:27,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=798, PETRI_PLACES=186, PETRI_TRANSITIONS=181} [2023-08-25 21:38:27,553 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -34 predicate places. [2023-08-25 21:38:27,553 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 181 transitions, 798 flow [2023-08-25 21:38:27,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 566.0) internal successors, (2830), 5 states have internal predecessors, (2830), 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) [2023-08-25 21:38:27,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:27,554 INFO L208 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] [2023-08-25 21:38:27,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 21:38:27,554 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:27,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash -547913123, now seen corresponding path program 3 times [2023-08-25 21:38:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139444513] [2023-08-25 21:38:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:27,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139444513] [2023-08-25 21:38:27,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139444513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:27,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:27,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 21:38:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629752025] [2023-08-25 21:38:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:27,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:27,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:27,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:27,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:27,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 181 transitions, 798 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:27,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:27,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:27,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:28,949 INFO L124 PetriNetUnfolderBase]: 6983/14594 cut-off events. [2023-08-25 21:38:28,949 INFO L125 PetriNetUnfolderBase]: For 16287/16361 co-relation queries the response was YES. [2023-08-25 21:38:28,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34199 conditions, 14594 events. 6983/14594 cut-off events. For 16287/16361 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 109525 event pairs, 4286 based on Foata normal form. 59/14171 useless extension candidates. Maximal degree in co-relation 34173. Up to 8607 conditions per place. [2023-08-25 21:38:29,030 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 202 selfloop transitions, 21 changer transitions 0/275 dead transitions. [2023-08-25 21:38:29,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 275 transitions, 1526 flow [2023-08-25 21:38:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3545 transitions. [2023-08-25 21:38:29,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811346362649294 [2023-08-25 21:38:29,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3545 transitions. [2023-08-25 21:38:29,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3545 transitions. [2023-08-25 21:38:29,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:29,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3545 transitions. [2023-08-25 21:38:29,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 590.8333333333334) internal successors, (3545), 6 states have internal predecessors, (3545), 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) [2023-08-25 21:38:29,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:29,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:29,041 INFO L175 Difference]: Start difference. First operand has 186 places, 181 transitions, 798 flow. Second operand 6 states and 3545 transitions. [2023-08-25 21:38:29,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 275 transitions, 1526 flow [2023-08-25 21:38:29,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 275 transitions, 1469 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-25 21:38:29,082 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 831 flow [2023-08-25 21:38:29,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2023-08-25 21:38:29,083 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -34 predicate places. [2023-08-25 21:38:29,083 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 831 flow [2023-08-25 21:38:29,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:29,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:29,084 INFO L208 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] [2023-08-25 21:38:29,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-25 21:38:29,084 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:29,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1225315153, now seen corresponding path program 4 times [2023-08-25 21:38:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538751549] [2023-08-25 21:38:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:29,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538751549] [2023-08-25 21:38:29,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538751549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 21:38:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484976990] [2023-08-25 21:38:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:29,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:29,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:29,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:29,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:29,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 831 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:29,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:29,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:29,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:30,558 INFO L124 PetriNetUnfolderBase]: 7418/15528 cut-off events. [2023-08-25 21:38:30,558 INFO L125 PetriNetUnfolderBase]: For 17653/17729 co-relation queries the response was YES. [2023-08-25 21:38:30,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36193 conditions, 15528 events. 7418/15528 cut-off events. For 17653/17729 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 118352 event pairs, 4690 based on Foata normal form. 64/15064 useless extension candidates. Maximal degree in co-relation 36169. Up to 9421 conditions per place. [2023-08-25 21:38:30,644 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 191 selfloop transitions, 20 changer transitions 0/263 dead transitions. [2023-08-25 21:38:30,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 263 transitions, 1495 flow [2023-08-25 21:38:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:38:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:38:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3529 transitions. [2023-08-25 21:38:30,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789630836047774 [2023-08-25 21:38:30,648 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3529 transitions. [2023-08-25 21:38:30,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3529 transitions. [2023-08-25 21:38:30,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:30,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3529 transitions. [2023-08-25 21:38:30,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 588.1666666666666) internal successors, (3529), 6 states have internal predecessors, (3529), 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) [2023-08-25 21:38:30,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:30,654 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 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) [2023-08-25 21:38:30,654 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 831 flow. Second operand 6 states and 3529 transitions. [2023-08-25 21:38:30,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 263 transitions, 1495 flow [2023-08-25 21:38:30,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 263 transitions, 1458 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-25 21:38:30,695 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 864 flow [2023-08-25 21:38:30,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2023-08-25 21:38:30,696 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -31 predicate places. [2023-08-25 21:38:30,696 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 864 flow [2023-08-25 21:38:30,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:30,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:30,696 INFO L208 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] [2023-08-25 21:38:30,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-25 21:38:30,696 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:30,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash -73785211, now seen corresponding path program 5 times [2023-08-25 21:38:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:30,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103600671] [2023-08-25 21:38:30,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:30,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103600671] [2023-08-25 21:38:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103600671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:30,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:30,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 21:38:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647470597] [2023-08-25 21:38:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:30,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:38:30,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:38:30,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:38:30,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:30,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 187 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:30,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:30,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:30,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:32,182 INFO L124 PetriNetUnfolderBase]: 7381/15465 cut-off events. [2023-08-25 21:38:32,182 INFO L125 PetriNetUnfolderBase]: For 18058/18152 co-relation queries the response was YES. [2023-08-25 21:38:32,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35918 conditions, 15465 events. 7381/15465 cut-off events. For 18058/18152 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 117752 event pairs, 3225 based on Foata normal form. 62/15027 useless extension candidates. Maximal degree in co-relation 35894. Up to 5945 conditions per place. [2023-08-25 21:38:32,269 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 219 selfloop transitions, 24 changer transitions 0/295 dead transitions. [2023-08-25 21:38:32,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 295 transitions, 1647 flow [2023-08-25 21:38:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 21:38:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 21:38:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4125 transitions. [2023-08-25 21:38:32,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798743601675198 [2023-08-25 21:38:32,280 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 4125 transitions. [2023-08-25 21:38:32,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 4125 transitions. [2023-08-25 21:38:32,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:32,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 4125 transitions. [2023-08-25 21:38:32,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 589.2857142857143) internal successors, (4125), 7 states have internal predecessors, (4125), 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) [2023-08-25 21:38:32,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1228.0) internal successors, (9824), 8 states have internal predecessors, (9824), 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) [2023-08-25 21:38:32,287 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1228.0) internal successors, (9824), 8 states have internal predecessors, (9824), 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) [2023-08-25 21:38:32,287 INFO L175 Difference]: Start difference. First operand has 189 places, 187 transitions, 864 flow. Second operand 7 states and 4125 transitions. [2023-08-25 21:38:32,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 295 transitions, 1647 flow [2023-08-25 21:38:32,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 295 transitions, 1597 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-25 21:38:32,333 INFO L231 Difference]: Finished difference. Result has 190 places, 186 transitions, 843 flow [2023-08-25 21:38:32,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=843, PETRI_PLACES=190, PETRI_TRANSITIONS=186} [2023-08-25 21:38:32,334 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -30 predicate places. [2023-08-25 21:38:32,334 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 186 transitions, 843 flow [2023-08-25 21:38:32,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 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) [2023-08-25 21:38:32,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:32,334 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:32,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-25 21:38:32,334 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:32,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1571069376, now seen corresponding path program 1 times [2023-08-25 21:38:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988612655] [2023-08-25 21:38:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:32,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:32,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988612655] [2023-08-25 21:38:32,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988612655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:38:32,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519431594] [2023-08-25 21:38:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:32,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:38:32,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:38:32,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:38:32,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 21:38:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:32,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 21:38:32,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:38:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:38:32,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 21:38:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519431594] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:32,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 21:38:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-08-25 21:38:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599064130] [2023-08-25 21:38:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:32,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:38:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:38:32,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-25 21:38:32,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:32,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 186 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 572.0) internal successors, (1716), 3 states have internal predecessors, (1716), 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) [2023-08-25 21:38:32,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:32,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:32,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:33,883 INFO L124 PetriNetUnfolderBase]: 7111/15277 cut-off events. [2023-08-25 21:38:33,883 INFO L125 PetriNetUnfolderBase]: For 15733/15788 co-relation queries the response was YES. [2023-08-25 21:38:33,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34704 conditions, 15277 events. 7111/15277 cut-off events. For 15733/15788 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 118391 event pairs, 5827 based on Foata normal form. 256/14989 useless extension candidates. Maximal degree in co-relation 34681. Up to 11594 conditions per place. [2023-08-25 21:38:33,967 INFO L140 encePairwiseOnDemand]: 1224/1228 looper letters, 127 selfloop transitions, 3 changer transitions 16/206 dead transitions. [2023-08-25 21:38:33,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 206 transitions, 1285 flow [2023-08-25 21:38:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:38:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:38:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1776 transitions. [2023-08-25 21:38:33,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820846905537459 [2023-08-25 21:38:33,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1776 transitions. [2023-08-25 21:38:33,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1776 transitions. [2023-08-25 21:38:33,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:33,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1776 transitions. [2023-08-25 21:38:33,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 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) [2023-08-25 21:38:33,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:33,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 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) [2023-08-25 21:38:33,973 INFO L175 Difference]: Start difference. First operand has 190 places, 186 transitions, 843 flow. Second operand 3 states and 1776 transitions. [2023-08-25 21:38:33,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 206 transitions, 1285 flow [2023-08-25 21:38:34,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 206 transitions, 1195 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-25 21:38:34,006 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 786 flow [2023-08-25 21:38:34,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2023-08-25 21:38:34,006 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -34 predicate places. [2023-08-25 21:38:34,006 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 786 flow [2023-08-25 21:38:34,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 572.0) internal successors, (1716), 3 states have internal predecessors, (1716), 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) [2023-08-25 21:38:34,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:34,007 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:34,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 21:38:34,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-25 21:38:34,211 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:34,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1635720040, now seen corresponding path program 1 times [2023-08-25 21:38:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860653861] [2023-08-25 21:38:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860653861] [2023-08-25 21:38:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860653861] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:38:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672605569] [2023-08-25 21:38:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:34,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:38:34,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:38:34,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:38:34,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 21:38:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:34,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-25 21:38:34,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:38:35,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 21:38:35,047 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:38:35,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-08-25 21:38:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:38:35,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:38:35,477 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 21:38:35,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-08-25 21:38:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:38:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672605569] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:38:35,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:38:35,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-08-25 21:38:35,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603928147] [2023-08-25 21:38:35,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:38:35,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-25 21:38:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-25 21:38:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2023-08-25 21:38:35,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 1228 [2023-08-25 21:38:35,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 786 flow. Second operand has 26 states, 26 states have (on average 392.5) internal successors, (10205), 26 states have internal predecessors, (10205), 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) [2023-08-25 21:38:35,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:35,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 1228 [2023-08-25 21:38:35,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:38:49,903 INFO L124 PetriNetUnfolderBase]: 48436/86172 cut-off events. [2023-08-25 21:38:49,903 INFO L125 PetriNetUnfolderBase]: For 67354/67488 co-relation queries the response was YES. [2023-08-25 21:38:50,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205368 conditions, 86172 events. 48436/86172 cut-off events. For 67354/67488 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 709188 event pairs, 6152 based on Foata normal form. 107/85471 useless extension candidates. Maximal degree in co-relation 205345. Up to 15744 conditions per place. [2023-08-25 21:38:50,488 INFO L140 encePairwiseOnDemand]: 1187/1228 looper letters, 1733 selfloop transitions, 228 changer transitions 145/2126 dead transitions. [2023-08-25 21:38:50,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 2126 transitions, 11200 flow [2023-08-25 21:38:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-08-25 21:38:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-08-25 21:38:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 27043 transitions. [2023-08-25 21:38:50,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387997995489852 [2023-08-25 21:38:50,505 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 27043 transitions. [2023-08-25 21:38:50,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 27043 transitions. [2023-08-25 21:38:50,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:38:50,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 27043 transitions. [2023-08-25 21:38:50,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 416.04615384615386) internal successors, (27043), 65 states have internal predecessors, (27043), 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) [2023-08-25 21:38:50,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 1228.0) internal successors, (81048), 66 states have internal predecessors, (81048), 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) [2023-08-25 21:38:50,570 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 1228.0) internal successors, (81048), 66 states have internal predecessors, (81048), 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) [2023-08-25 21:38:50,570 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 786 flow. Second operand 65 states and 27043 transitions. [2023-08-25 21:38:50,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 2126 transitions, 11200 flow [2023-08-25 21:38:51,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2126 transitions, 11173 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:38:51,158 INFO L231 Difference]: Finished difference. Result has 294 places, 389 transitions, 3130 flow [2023-08-25 21:38:51,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=3130, PETRI_PLACES=294, PETRI_TRANSITIONS=389} [2023-08-25 21:38:51,158 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 74 predicate places. [2023-08-25 21:38:51,158 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 389 transitions, 3130 flow [2023-08-25 21:38:51,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 392.5) internal successors, (10205), 26 states have internal predecessors, (10205), 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) [2023-08-25 21:38:51,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:38:51,160 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:38:51,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-25 21:38:51,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-25 21:38:51,360 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:38:51,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:38:51,361 INFO L85 PathProgramCache]: Analyzing trace with hash -209681590, now seen corresponding path program 2 times [2023-08-25 21:38:51,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:38:51,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494908964] [2023-08-25 21:38:51,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:38:51,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:38:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:38:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:38:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:38:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494908964] [2023-08-25 21:38:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494908964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:38:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:38:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 21:38:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107400110] [2023-08-25 21:38:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:38:51,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 21:38:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:38:51,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 21:38:51,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-25 21:38:51,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 21:38:51,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 389 transitions, 3130 flow. Second operand has 8 states, 8 states have (on average 564.625) internal successors, (4517), 8 states have internal predecessors, (4517), 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) [2023-08-25 21:38:51,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:38:51,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 21:38:51,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:39:00,394 INFO L124 PetriNetUnfolderBase]: 24279/53911 cut-off events. [2023-08-25 21:39:00,395 INFO L125 PetriNetUnfolderBase]: For 293535/294122 co-relation queries the response was YES. [2023-08-25 21:39:00,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178561 conditions, 53911 events. 24279/53911 cut-off events. For 293535/294122 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 527096 event pairs, 12618 based on Foata normal form. 163/53585 useless extension candidates. Maximal degree in co-relation 178493. Up to 20216 conditions per place. [2023-08-25 21:39:01,075 INFO L140 encePairwiseOnDemand]: 1218/1228 looper letters, 491 selfloop transitions, 109 changer transitions 2/654 dead transitions. [2023-08-25 21:39:01,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 654 transitions, 5929 flow [2023-08-25 21:39:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 21:39:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 21:39:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5324 transitions. [2023-08-25 21:39:01,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48172276511038725 [2023-08-25 21:39:01,079 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 5324 transitions. [2023-08-25 21:39:01,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 5324 transitions. [2023-08-25 21:39:01,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:39:01,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 5324 transitions. [2023-08-25 21:39:01,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 591.5555555555555) internal successors, (5324), 9 states have internal predecessors, (5324), 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) [2023-08-25 21:39:01,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1228.0) internal successors, (12280), 10 states have internal predecessors, (12280), 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) [2023-08-25 21:39:01,087 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1228.0) internal successors, (12280), 10 states have internal predecessors, (12280), 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) [2023-08-25 21:39:01,087 INFO L175 Difference]: Start difference. First operand has 294 places, 389 transitions, 3130 flow. Second operand 9 states and 5324 transitions. [2023-08-25 21:39:01,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 654 transitions, 5929 flow [2023-08-25 21:39:02,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 654 transitions, 5722 flow, removed 89 selfloop flow, removed 2 redundant places. [2023-08-25 21:39:02,773 INFO L231 Difference]: Finished difference. Result has 300 places, 403 transitions, 3383 flow [2023-08-25 21:39:02,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=2976, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3383, PETRI_PLACES=300, PETRI_TRANSITIONS=403} [2023-08-25 21:39:02,774 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 80 predicate places. [2023-08-25 21:39:02,774 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 403 transitions, 3383 flow [2023-08-25 21:39:02,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 564.625) internal successors, (4517), 8 states have internal predecessors, (4517), 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) [2023-08-25 21:39:02,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:39:02,775 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:39:02,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-25 21:39:02,775 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:39:02,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:39:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -256421234, now seen corresponding path program 3 times [2023-08-25 21:39:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:39:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515977293] [2023-08-25 21:39:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:39:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:39:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:39:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:39:03,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:39:03,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515977293] [2023-08-25 21:39:03,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515977293] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:39:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013080345] [2023-08-25 21:39:03,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 21:39:03,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:39:03,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:39:03,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:39:03,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 21:39:03,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 21:39:03,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:39:03,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-25 21:39:03,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:39:03,403 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 21:39:03,404 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2023-08-25 21:39:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:39:03,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:39:03,765 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 21:39:03,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-08-25 21:39:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:39:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013080345] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:39:03,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:39:03,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2023-08-25 21:39:03,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985100591] [2023-08-25 21:39:03,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:39:03,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-25 21:39:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:39:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-25 21:39:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2023-08-25 21:39:03,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 1228 [2023-08-25 21:39:03,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 403 transitions, 3383 flow. Second operand has 25 states, 25 states have (on average 394.56) internal successors, (9864), 25 states have internal predecessors, (9864), 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) [2023-08-25 21:39:03,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:39:03,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 1228 [2023-08-25 21:39:03,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:39:28,711 INFO L124 PetriNetUnfolderBase]: 74885/132186 cut-off events. [2023-08-25 21:39:28,711 INFO L125 PetriNetUnfolderBase]: For 591286/591445 co-relation queries the response was YES. [2023-08-25 21:39:30,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429723 conditions, 132186 events. 74885/132186 cut-off events. For 591286/591445 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 1158856 event pairs, 18422 based on Foata normal form. 478/132405 useless extension candidates. Maximal degree in co-relation 429651. Up to 50075 conditions per place. [2023-08-25 21:39:30,828 INFO L140 encePairwiseOnDemand]: 1187/1228 looper letters, 1862 selfloop transitions, 413 changer transitions 70/2365 dead transitions. [2023-08-25 21:39:30,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 2365 transitions, 17414 flow [2023-08-25 21:39:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-08-25 21:39:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-08-25 21:39:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 32217 transitions. [2023-08-25 21:39:30,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33635053871210224 [2023-08-25 21:39:30,847 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 32217 transitions. [2023-08-25 21:39:30,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 32217 transitions. [2023-08-25 21:39:30,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:39:30,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 32217 transitions. [2023-08-25 21:39:30,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 413.03846153846155) internal successors, (32217), 78 states have internal predecessors, (32217), 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) [2023-08-25 21:39:30,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 1228.0) internal successors, (97012), 79 states have internal predecessors, (97012), 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) [2023-08-25 21:39:30,926 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 1228.0) internal successors, (97012), 79 states have internal predecessors, (97012), 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) [2023-08-25 21:39:30,926 INFO L175 Difference]: Start difference. First operand has 300 places, 403 transitions, 3383 flow. Second operand 78 states and 32217 transitions. [2023-08-25 21:39:30,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 2365 transitions, 17414 flow [2023-08-25 21:39:36,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 2365 transitions, 17044 flow, removed 71 selfloop flow, removed 3 redundant places. [2023-08-25 21:39:36,229 INFO L231 Difference]: Finished difference. Result has 409 places, 668 transitions, 7824 flow [2023-08-25 21:39:36,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=3257, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=7824, PETRI_PLACES=409, PETRI_TRANSITIONS=668} [2023-08-25 21:39:36,229 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 189 predicate places. [2023-08-25 21:39:36,229 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 668 transitions, 7824 flow [2023-08-25 21:39:36,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 394.56) internal successors, (9864), 25 states have internal predecessors, (9864), 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) [2023-08-25 21:39:36,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:39:36,231 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:39:36,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 21:39:36,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:39:36,435 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:39:36,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:39:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1130514234, now seen corresponding path program 4 times [2023-08-25 21:39:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:39:36,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709406522] [2023-08-25 21:39:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:39:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:39:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:39:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:39:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:39:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709406522] [2023-08-25 21:39:36,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709406522] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:39:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125973489] [2023-08-25 21:39:36,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 21:39:36,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:39:36,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:39:36,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:39:36,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 21:39:38,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 21:39:38,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:39:38,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-25 21:39:38,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:39:38,904 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 21:39:38,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2023-08-25 21:39:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:39:38,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:39:39,159 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 21:39:39,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-08-25 21:39:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:39:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125973489] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:39:39,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:39:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2023-08-25 21:39:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426794569] [2023-08-25 21:39:39,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:39:39,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-25 21:39:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:39:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-25 21:39:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2023-08-25 21:39:39,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 1228 [2023-08-25 21:39:39,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 668 transitions, 7824 flow. Second operand has 25 states, 25 states have (on average 394.76) internal successors, (9869), 25 states have internal predecessors, (9869), 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) [2023-08-25 21:39:39,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:39:39,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 1228 [2023-08-25 21:39:39,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:17,218 INFO L124 PetriNetUnfolderBase]: 89018/157686 cut-off events. [2023-08-25 21:40:17,218 INFO L125 PetriNetUnfolderBase]: For 1123737/1123927 co-relation queries the response was YES. [2023-08-25 21:40:20,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577773 conditions, 157686 events. 89018/157686 cut-off events. For 1123737/1123927 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 1422739 event pairs, 14964 based on Foata normal form. 587/157898 useless extension candidates. Maximal degree in co-relation 577666. Up to 42603 conditions per place. [2023-08-25 21:40:21,369 INFO L140 encePairwiseOnDemand]: 1190/1228 looper letters, 1727 selfloop transitions, 555 changer transitions 63/2365 dead transitions. [2023-08-25 21:40:21,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 2365 transitions, 21880 flow [2023-08-25 21:40:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-08-25 21:40:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-08-25 21:40:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 23896 transitions. [2023-08-25 21:40:21,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139093662495 [2023-08-25 21:40:21,384 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 23896 transitions. [2023-08-25 21:40:21,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 23896 transitions. [2023-08-25 21:40:21,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:21,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 23896 transitions. [2023-08-25 21:40:21,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 419.2280701754386) internal successors, (23896), 57 states have internal predecessors, (23896), 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) [2023-08-25 21:40:21,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 1228.0) internal successors, (71224), 58 states have internal predecessors, (71224), 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) [2023-08-25 21:40:21,446 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 1228.0) internal successors, (71224), 58 states have internal predecessors, (71224), 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) [2023-08-25 21:40:21,446 INFO L175 Difference]: Start difference. First operand has 409 places, 668 transitions, 7824 flow. Second operand 57 states and 23896 transitions. [2023-08-25 21:40:21,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 2365 transitions, 21880 flow [2023-08-25 21:40:43,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 2365 transitions, 19636 flow, removed 889 selfloop flow, removed 29 redundant places. [2023-08-25 21:40:43,139 INFO L231 Difference]: Finished difference. Result has 452 places, 840 transitions, 10147 flow [2023-08-25 21:40:43,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=6603, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=10147, PETRI_PLACES=452, PETRI_TRANSITIONS=840} [2023-08-25 21:40:43,140 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 232 predicate places. [2023-08-25 21:40:43,140 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 840 transitions, 10147 flow [2023-08-25 21:40:43,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 394.76) internal successors, (9869), 25 states have internal predecessors, (9869), 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) [2023-08-25 21:40:43,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:43,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:43,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 21:40:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-25 21:40:43,345 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 21:40:43,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 729770896, now seen corresponding path program 5 times [2023-08-25 21:40:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684731658] [2023-08-25 21:40:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:40:43,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684731658] [2023-08-25 21:40:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684731658] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:40:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139152306] [2023-08-25 21:40:43,616 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 21:40:43,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:40:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:40:43,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:40:43,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 21:40:43,793 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 21:40:43,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:40:43,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 70 conjunts are in the unsatisfiable core [2023-08-25 21:40:43,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:40:43,837 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 21:40:43,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:40:44,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:40:44,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-25 21:40:44,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 21:40:44,940 INFO L322 Elim1Store]: treesize reduction 38, result has 20.8 percent of original size [2023-08-25 21:40:44,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 30 [2023-08-25 21:40:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:40:45,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:40:45,784 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1524 (Array Int Int)) (v_~x2~0_581 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (<= c_~size~0 .cse0) (< v_~x2~0_581 (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (= (select .cse1 (+ (* v_~x2~0_581 4) c_~f~0.offset)) |c_thread1Thread1of1ForFork1_#t~mem2#1|) (< .cse0 0) (<= c_~size~0 v_~x2~0_581))))) is different from false [2023-08-25 21:40:45,844 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1524 (Array Int Int)) (v_~x2~0_581 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (<= c_~size~0 .cse0) (< v_~x2~0_581 (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (= (select .cse1 (+ (* v_~x2~0_581 4) c_~f~0.offset)) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset))) (< .cse0 0) (<= c_~size~0 v_~x2~0_581))))) is different from false [2023-08-25 21:40:46,224 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:40:46,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 106 [2023-08-25 21:40:46,250 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:40:46,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 429 treesize of output 417 [2023-08-25 21:40:46,279 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:40:46,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 247 [2023-08-25 21:40:46,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:40:46,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 149 [2023-08-25 21:40:49,722 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-25 21:40:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:40:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139152306] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:40:49,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:40:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 19] total 47 [2023-08-25 21:40:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700913720] [2023-08-25 21:40:49,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:40:49,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-08-25 21:40:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-08-25 21:40:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1790, Unknown=5, NotChecked=174, Total=2162 [2023-08-25 21:40:49,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1228 [2023-08-25 21:40:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 840 transitions, 10147 flow. Second operand has 47 states, 47 states have (on average 369.27659574468083) internal successors, (17356), 47 states have internal predecessors, (17356), 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) [2023-08-25 21:40:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:49,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1228 [2023-08-25 21:40:49,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:41:02,282 WARN L234 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 78 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:41:13,254 WARN L234 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 103 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:41:15,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:41:17,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:41:19,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:41:21,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:41:25,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:41:38,255 WARN L234 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 106 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:41:42,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:41:56,688 WARN L234 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 107 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:41:58,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:00,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:03,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:05,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:07,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:09,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:12,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:23,600 WARN L234 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 89 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:42:33,156 WARN L234 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 117 DAG size of output: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:42:35,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:37,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:40,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:42,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:42:56,775 WARN L234 SmtUtils]: Spent 13.48s on a formula simplification. DAG size of input: 114 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:42:58,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:00,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:02,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:11,389 WARN L234 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 117 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:43:13,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:18,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:20,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:23,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:36,459 WARN L234 SmtUtils]: Spent 11.98s on a formula simplification. DAG size of input: 71 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:43:38,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:47,115 WARN L234 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 121 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:43:48,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:43:57,098 WARN L234 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 120 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:44:09,830 WARN L234 SmtUtils]: Spent 12.53s on a formula simplification. DAG size of input: 100 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:44:11,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:13,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:16,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:19,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:21,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:23,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:25,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:29,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:31,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:32,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:42,583 WARN L234 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 118 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:44:53,200 WARN L234 SmtUtils]: Spent 10.35s on a formula simplification. DAG size of input: 99 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:44:55,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:57,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:44:59,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:01,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:03,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:05,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:07,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:09,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:11,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:13,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:15,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:17,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:19,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:22,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:24,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:26,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:28,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:30,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:32,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:35,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:37,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:39,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:41,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:44,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:46,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:48,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:50,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:45:52,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:02,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:09,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:13,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:15,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:18,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:20,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:22,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:24,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:26,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:28,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:30,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:32,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:34,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:35,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:37,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:39,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:41,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:43,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:45,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:47,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:49,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:51,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:54,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:46:56,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:46:58,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:00,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:03,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:07,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:16,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:18,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:20,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:23,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:43,741 WARN L234 SmtUtils]: Spent 12.74s on a formula simplification. DAG size of input: 82 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:47:48,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:47:50,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:48:13,355 WARN L234 SmtUtils]: Spent 21.48s on a formula simplification. DAG size of input: 111 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:48:24,821 WARN L234 SmtUtils]: Spent 11.30s on a formula simplification. DAG size of input: 114 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:48:26,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:48:32,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:48:34,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:48:48,577 WARN L234 SmtUtils]: Spent 14.26s on a formula simplification. DAG size of input: 110 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:48:59,188 WARN L234 SmtUtils]: Spent 10.43s on a formula simplification. DAG size of input: 113 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:49:01,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:03,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:05,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:09,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:11,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:13,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:15,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:17,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:19,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:21,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:23,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:25,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:27,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:29,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:31,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:33,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:35,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:37,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:39,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:41,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:43,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:45,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:47,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:49,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:51,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:53,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:54,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:56,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:49:58,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:00,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:02,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:04,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:06,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:08,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:10,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:12,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:14,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:16,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:18,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:20,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:22,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:24,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:26,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:28,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:30,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:32,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:34,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:36,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:39,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:44,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:46,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:48,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:50,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:52,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:54,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:56,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:50:58,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:00,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:02,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:04,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:06,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:08,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:11,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:13,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:15,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:17,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:22,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:24,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:26,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:28,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:30,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:32,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:34,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:51:36,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2023-08-25 21:51:36,817 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:51:36,817 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:51:37,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 21:51:38,018 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 21:51:38,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (164 of 165 remaining) [2023-08-25 21:51:38,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-25 21:51:38,051 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (163 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (162 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (161 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (160 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (159 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (158 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (157 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (156 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (155 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err36ASSERT_VIOLATIONDATA_RACE (154 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (153 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err37ASSERT_VIOLATIONDATA_RACE (152 of 165 remaining) [2023-08-25 21:51:38,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err44ASSERT_VIOLATIONDATA_RACE (151 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (150 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err45ASSERT_VIOLATIONDATA_RACE (149 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err52ASSERT_VIOLATIONDATA_RACE (148 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err38ASSERT_VIOLATIONDATA_RACE (147 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (146 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err39ASSERT_VIOLATIONDATA_RACE (145 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err53ASSERT_VIOLATIONDATA_RACE (144 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err60ASSERT_VIOLATIONDATA_RACE (143 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err46ASSERT_VIOLATIONDATA_RACE (142 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (141 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err40ASSERT_VIOLATIONDATA_RACE (140 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err47ASSERT_VIOLATIONDATA_RACE (139 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err61ASSERT_VIOLATIONDATA_RACE (138 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (137 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err54ASSERT_VIOLATIONDATA_RACE (136 of 165 remaining) [2023-08-25 21:51:38,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err41ASSERT_VIOLATIONDATA_RACE (135 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err48ASSERT_VIOLATIONDATA_RACE (134 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err55ASSERT_VIOLATIONDATA_RACE (133 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err62ASSERT_VIOLATIONDATA_RACE (132 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err49ASSERT_VIOLATIONDATA_RACE (131 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err56ASSERT_VIOLATIONDATA_RACE (130 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err63ASSERT_VIOLATIONDATA_RACE (129 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (128 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err42ASSERT_VIOLATIONDATA_RACE (127 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err57ASSERT_VIOLATIONDATA_RACE (126 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err64ASSERT_VIOLATIONDATA_RACE (125 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (124 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err50ASSERT_VIOLATIONDATA_RACE (123 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err65ASSERT_VIOLATIONDATA_RACE (122 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err43ASSERT_VIOLATIONDATA_RACE (121 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err58ASSERT_VIOLATIONDATA_RACE (120 of 165 remaining) [2023-08-25 21:51:38,054 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err51ASSERT_VIOLATIONDATA_RACE (119 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err66ASSERT_VIOLATIONDATA_RACE (118 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (117 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err59ASSERT_VIOLATIONDATA_RACE (116 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err67ASSERT_VIOLATIONDATA_RACE (115 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (114 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (113 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (112 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (111 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (110 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (109 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (108 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (107 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (106 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (105 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (104 of 165 remaining) [2023-08-25 21:51:38,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (103 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (102 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (101 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (100 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (99 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err25ASSERT_VIOLATIONDATA_RACE (98 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err26ASSERT_VIOLATIONDATA_RACE (97 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err27ASSERT_VIOLATIONDATA_RACE (96 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err28ASSERT_VIOLATIONDATA_RACE (95 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err29ASSERT_VIOLATIONDATA_RACE (94 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err30ASSERT_VIOLATIONDATA_RACE (93 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err31ASSERT_VIOLATIONDATA_RACE (92 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err32ASSERT_VIOLATIONDATA_RACE (91 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err33ASSERT_VIOLATIONDATA_RACE (90 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err34ASSERT_VIOLATIONDATA_RACE (89 of 165 remaining) [2023-08-25 21:51:38,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err35ASSERT_VIOLATIONDATA_RACE (88 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (82 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (77 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (76 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 165 remaining) [2023-08-25 21:51:38,057 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (69 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (68 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err36ASSERT_VIOLATIONDATA_RACE (66 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (65 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err37ASSERT_VIOLATIONDATA_RACE (64 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err44ASSERT_VIOLATIONDATA_RACE (63 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err45ASSERT_VIOLATIONDATA_RACE (61 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err52ASSERT_VIOLATIONDATA_RACE (60 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err38ASSERT_VIOLATIONDATA_RACE (59 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err39ASSERT_VIOLATIONDATA_RACE (57 of 165 remaining) [2023-08-25 21:51:38,058 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err53ASSERT_VIOLATIONDATA_RACE (56 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err60ASSERT_VIOLATIONDATA_RACE (55 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err46ASSERT_VIOLATIONDATA_RACE (54 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err40ASSERT_VIOLATIONDATA_RACE (52 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err47ASSERT_VIOLATIONDATA_RACE (51 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err61ASSERT_VIOLATIONDATA_RACE (50 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err54ASSERT_VIOLATIONDATA_RACE (48 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err41ASSERT_VIOLATIONDATA_RACE (47 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err48ASSERT_VIOLATIONDATA_RACE (46 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err55ASSERT_VIOLATIONDATA_RACE (45 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err62ASSERT_VIOLATIONDATA_RACE (44 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err49ASSERT_VIOLATIONDATA_RACE (43 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err56ASSERT_VIOLATIONDATA_RACE (42 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err63ASSERT_VIOLATIONDATA_RACE (41 of 165 remaining) [2023-08-25 21:51:38,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err42ASSERT_VIOLATIONDATA_RACE (39 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err57ASSERT_VIOLATIONDATA_RACE (38 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err64ASSERT_VIOLATIONDATA_RACE (37 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (36 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err50ASSERT_VIOLATIONDATA_RACE (35 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err65ASSERT_VIOLATIONDATA_RACE (34 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err43ASSERT_VIOLATIONDATA_RACE (33 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err58ASSERT_VIOLATIONDATA_RACE (32 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err51ASSERT_VIOLATIONDATA_RACE (31 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err66ASSERT_VIOLATIONDATA_RACE (30 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (29 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err59ASSERT_VIOLATIONDATA_RACE (28 of 165 remaining) [2023-08-25 21:51:38,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err67ASSERT_VIOLATIONDATA_RACE (27 of 165 remaining) [2023-08-25 21:51:38,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 21:51:38,063 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 165 remaining) [2023-08-25 21:51:38,063 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 165 remaining) [2023-08-25 21:51:38,063 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 165 remaining) [2023-08-25 21:51:38,063 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 165 remaining) [2023-08-25 21:51:38,063 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 165 remaining) [2023-08-25 21:51:38,063 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 165 remaining) [2023-08-25 21:51:38,063 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err26ASSERT_VIOLATIONDATA_RACE (9 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err27ASSERT_VIOLATIONDATA_RACE (8 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 165 remaining) [2023-08-25 21:51:38,064 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err31ASSERT_VIOLATIONDATA_RACE (4 of 165 remaining) [2023-08-25 21:51:38,065 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err32ASSERT_VIOLATIONDATA_RACE (3 of 165 remaining) [2023-08-25 21:51:38,065 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 165 remaining) [2023-08-25 21:51:38,065 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 165 remaining) [2023-08-25 21:51:38,065 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 165 remaining) [2023-08-25 21:51:38,065 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:51:38,069 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 21:51:38,069 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 21:51:38,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 09:51:38 BasicIcfg [2023-08-25 21:51:38,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 21:51:38,071 INFO L158 Benchmark]: Toolchain (without parser) took 827693.08ms. Allocated memory was 371.2MB in the beginning and 14.9GB in the end (delta: 14.5GB). Free memory was 346.7MB in the beginning and 8.9GB in the end (delta: -8.6GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-08-25 21:51:38,071 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 371.2MB. Free memory was 348.9MB in the beginning and 348.8MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 21:51:38,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 371.2MB. Free memory was 346.7MB in the beginning and 333.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 21:51:38,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.92ms. Allocated memory is still 371.2MB. Free memory was 333.2MB in the beginning and 329.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 21:51:38,071 INFO L158 Benchmark]: Boogie Preprocessor took 39.82ms. Allocated memory is still 371.2MB. Free memory was 329.0MB in the beginning and 325.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 21:51:38,071 INFO L158 Benchmark]: RCFGBuilder took 663.31ms. Allocated memory is still 371.2MB. Free memory was 325.4MB in the beginning and 282.3MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-25 21:51:38,071 INFO L158 Benchmark]: TraceAbstraction took 826683.80ms. Allocated memory was 371.2MB in the beginning and 14.9GB in the end (delta: 14.5GB). Free memory was 281.9MB in the beginning and 8.9GB in the end (delta: -8.7GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. [2023-08-25 21:51:38,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 371.2MB. Free memory was 348.9MB in the beginning and 348.8MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 235.66ms. Allocated memory is still 371.2MB. Free memory was 346.7MB in the beginning and 333.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.92ms. Allocated memory is still 371.2MB. Free memory was 333.2MB in the beginning and 329.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.82ms. Allocated memory is still 371.2MB. Free memory was 329.0MB in the beginning and 325.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 663.31ms. Allocated memory is still 371.2MB. Free memory was 325.4MB in the beginning and 282.3MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 826683.80ms. Allocated memory was 371.2MB in the beginning and 14.9GB in the end (delta: 14.5GB). Free memory was 281.9MB in the beginning and 8.9GB in the end (delta: -8.7GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 579 PlacesBefore, 220 PlacesAfterwards, 606 TransitionsBefore, 232 TransitionsAfterwards, 59800 CoEnabledTransitionPairs, 8 FixpointIterations, 122 TrivialSequentialCompositions, 386 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 75 ConcurrentYvCompositions, 15 ChoiceCompositions, 611 TotalNumberOfCompositions, 241078 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69585, independent: 67153, independent conditional: 0, independent unconditional: 67153, dependent: 2432, dependent conditional: 0, dependent unconditional: 2432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 33928, independent: 33520, independent conditional: 0, independent unconditional: 33520, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 69585, independent: 33633, independent conditional: 0, independent unconditional: 33633, dependent: 2024, dependent conditional: 0, dependent unconditional: 2024, unknown: 33928, unknown conditional: 0, unknown unconditional: 33928] , Statistics on independence cache: Total cache size (in pairs): 3184, Positive cache size: 2941, Positive conditional cache size: 0, Positive unconditional cache size: 2941, Negative cache size: 243, Negative conditional cache size: 0, Negative unconditional cache size: 243, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1028 locations, 165 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 826.5s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 801.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 427 mSolverCounterUnknown, 10820 SdHoareTripleChecker+Valid, 398.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10820 mSDsluCounter, 7485 SdHoareTripleChecker+Invalid, 393.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3782 IncrementalHoareTripleChecker+Unchecked, 6834 mSDsCounter, 870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60848 IncrementalHoareTripleChecker+Invalid, 65928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 870 mSolverCounterUnsat, 651 mSDtfsCounter, 60848 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1171 GetRequests, 674 SyntacticMatches, 10 SemanticMatches, 487 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13712 ImplicationChecksByTransitivity, 258.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10147occurred in iteration=26, InterpolantAutomatonStates: 319, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 1440 NumberOfCodeBlocks, 1440 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1692 ConstructedInterpolants, 188 QuantifiedInterpolants, 19095 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2344 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 36 InterpolantComputations, 23 PerfectInterpolantSequences, 27/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown