/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 15:31:10,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 15:31:10,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 15:31:10,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 15:31:10,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 15:31:10,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 15:31:10,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 15:31:10,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 15:31:10,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 15:31:10,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 15:31:10,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 15:31:10,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 15:31:10,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 15:31:10,422 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 15:31:10,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 15:31:10,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 15:31:10,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 15:31:10,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 15:31:10,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 15:31:10,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 15:31:10,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 15:31:10,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 15:31:10,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 15:31:10,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 15:31:10,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 15:31:10,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 15:31:10,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 15:31:10,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 15:31:10,425 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 15:31:10,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 15:31:10,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 15:31:10,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 15:31:10,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 15:31:10,426 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 15:31:10,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 15:31:10,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 15:31:10,426 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 15:31:10,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 15:31:10,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 15:31:10,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 15:31:10,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 15:31:10,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 15:31:10,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 15:31:10,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 15:31:10,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 15:31:10,622 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 15:31:10,622 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 15:31:10,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-05-30 15:31:11,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 15:31:11,851 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 15:31:11,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-05-30 15:31:11,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/14cd7b93e/a632371ee37844e594f654958bb9cece/FLAGbc62c21bf [2024-05-30 15:31:11,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/14cd7b93e/a632371ee37844e594f654958bb9cece [2024-05-30 15:31:11,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 15:31:11,901 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 15:31:11,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 15:31:11,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 15:31:11,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 15:31:11,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 03:31:11" (1/1) ... [2024-05-30 15:31:11,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15717f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:11, skipping insertion in model container [2024-05-30 15:31:11,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 03:31:11" (1/1) ... [2024-05-30 15:31:11,929 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 15:31:12,079 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2024-05-30 15:31:12,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 15:31:12,091 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 15:31:12,107 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2024-05-30 15:31:12,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 15:31:12,119 INFO L206 MainTranslator]: Completed translation [2024-05-30 15:31:12,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12 WrapperNode [2024-05-30 15:31:12,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 15:31:12,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 15:31:12,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 15:31:12,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 15:31:12,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,180 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-05-30 15:31:12,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 15:31:12,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 15:31:12,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 15:31:12,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 15:31:12,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 15:31:12,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 15:31:12,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 15:31:12,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 15:31:12,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (1/1) ... [2024-05-30 15:31:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 15:31:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 15:31:12,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 15:31:12,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 15:31:12,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 15:31:12,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 15:31:12,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 15:31:12,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 15:31:12,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 15:31:12,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 15:31:12,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 15:31:12,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-30 15:31:12,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-30 15:31:12,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 15:31:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 15:31:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 15:31:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 15:31:12,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 15:31:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 15:31:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 15:31:12,315 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 15:31:12,401 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 15:31:12,403 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 15:31:12,553 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 15:31:12,561 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 15:31:12,561 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-30 15:31:12,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 03:31:12 BoogieIcfgContainer [2024-05-30 15:31:12,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 15:31:12,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 15:31:12,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 15:31:12,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 15:31:12,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 03:31:11" (1/3) ... [2024-05-30 15:31:12,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779b2c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 03:31:12, skipping insertion in model container [2024-05-30 15:31:12,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 03:31:12" (2/3) ... [2024-05-30 15:31:12,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779b2c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 03:31:12, skipping insertion in model container [2024-05-30 15:31:12,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 03:31:12" (3/3) ... [2024-05-30 15:31:12,567 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-05-30 15:31:12,577 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 15:31:12,585 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 15:31:12,585 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 15:31:12,585 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 15:31:12,643 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-30 15:31:12,699 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 15:31:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 15:31:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 15:31:12,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 15:31:12,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 15:31:12,781 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 15:31:12,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 15:31:12,796 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@17364b96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 15:31:12,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 15:31:12,804 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 15:31:12,949 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:12,950 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:12,950 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:12,964 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:12,965 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:12,965 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:12,975 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:12,975 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:12,975 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,009 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,010 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,010 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,045 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,045 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,045 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,049 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,049 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,049 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,065 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,066 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,066 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,077 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,077 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,077 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,095 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,095 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,095 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,129 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,129 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,143 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,144 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,144 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,147 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,147 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,172 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,173 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,173 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,185 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,185 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,185 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,202 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,202 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,202 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,221 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,222 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,222 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,236 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,237 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,237 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,240 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,240 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,240 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,265 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,266 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,266 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,276 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,277 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,277 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,294 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,294 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,294 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,312 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,312 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,312 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,346 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,347 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,347 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,353 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,353 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,354 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,373 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,373 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,373 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,383 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,384 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,384 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,406 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,406 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,406 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,428 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,429 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,429 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,439 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,439 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,440 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,442 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,442 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,442 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,446 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,446 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,446 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,463 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,463 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,464 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,470 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,470 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,470 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,478 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,479 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,479 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,490 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,490 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,490 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,500 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,500 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,501 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,503 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,505 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,505 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,519 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,523 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,524 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,527 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 450 states. [2024-05-30 15:31:13,527 INFO L212 cStratifiedReduction]: Copied states 31 times. [2024-05-30 15:31:13,530 INFO L78 Accepts]: Start accepts. Automaton has currently 560 states, but on-demand construction may add more states Word has length 95 [2024-05-30 15:31:13,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 15:31:13,533 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 15:31:13,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 15:31:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1137327282, now seen corresponding path program 1 times [2024-05-30 15:31:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 15:31:13,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200744382] [2024-05-30 15:31:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 15:31:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 15:31:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 15:31:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:13,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 15:31:13,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200744382] [2024-05-30 15:31:13,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200744382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 15:31:13,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 15:31:13,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 15:31:13,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326030846] [2024-05-30 15:31:13,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 15:31:13,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 15:31:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 15:31:13,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 15:31:13,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 15:31:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:13,887 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 15:31:13,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 15:31:13,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:13,889 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 15:31:13,926 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,926 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,926 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,930 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,930 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,930 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,938 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,938 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,938 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,944 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,944 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,945 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,950 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,950 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,950 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,951 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,951 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,951 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,957 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,958 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,958 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,962 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,962 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,962 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,969 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,970 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,970 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,982 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,983 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,983 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,989 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,989 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,989 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:13,990 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:13,990 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:13,990 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,000 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,001 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,001 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,008 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,008 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,008 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,015 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,015 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,016 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,024 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,027 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,027 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,035 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,035 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,035 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,036 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,036 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,036 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,049 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,049 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,049 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,054 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,055 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,055 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,062 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,063 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,063 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,074 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,074 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,074 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,083 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,083 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,083 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,084 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,084 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,084 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,093 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,093 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,094 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,098 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,098 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,098 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,109 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,109 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,109 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,117 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,118 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,118 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,123 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,124 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,124 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,125 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,125 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,125 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,128 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,128 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,128 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,141 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,142 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,142 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,145 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,145 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,146 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,188 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,188 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,189 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,195 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,195 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,195 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,200 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,200 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,200 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,201 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,201 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,201 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,216 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:14,216 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:14,216 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:14,223 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 578 states. [2024-05-30 15:31:14,224 INFO L212 cStratifiedReduction]: Copied states 31 times. [2024-05-30 15:31:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:14,224 INFO L78 Accepts]: Start accepts. Automaton has currently 721 states, but on-demand construction may add more states Word has length 93 [2024-05-30 15:31:14,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 15:31:14,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 15:31:14,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 15:31:14,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 15:31:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2081383793, now seen corresponding path program 1 times [2024-05-30 15:31:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 15:31:14,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896653252] [2024-05-30 15:31:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 15:31:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 15:31:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 15:31:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 15:31:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896653252] [2024-05-30 15:31:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896653252] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 15:31:14,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 15:31:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 15:31:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480557769] [2024-05-30 15:31:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 15:31:14,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 15:31:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 15:31:14,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 15:31:14,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-30 15:31:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:14,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 15:31:14,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 15:31:14,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:14,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:14,897 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 15:31:15,061 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,062 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,062 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,066 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,066 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,066 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,069 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,069 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,070 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,075 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,075 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,075 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,080 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,082 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,082 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,083 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,083 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,083 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,088 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,088 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,088 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,091 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,091 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,092 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,096 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,097 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,097 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,104 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,104 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,104 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,109 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,109 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,109 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,110 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,110 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,110 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,120 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,120 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,120 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,124 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,125 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,125 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,131 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,131 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,131 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,139 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,139 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,139 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,145 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,145 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,146 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,147 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,150 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,162 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,167 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,168 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,168 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,175 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,175 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,175 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,183 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,184 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,184 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,191 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,192 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,192 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,193 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,193 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,194 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,202 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,203 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,203 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,209 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,209 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,209 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,216 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,216 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,216 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,223 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,223 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,224 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,235 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,236 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,236 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,237 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,237 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,237 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,239 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,239 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,240 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,251 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,251 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,252 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,254 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,255 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,255 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,259 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,259 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,259 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,265 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,265 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,265 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,270 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,270 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,270 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,271 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,271 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,271 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,278 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:15,278 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:15,278 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:15,300 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 593 states. [2024-05-30 15:31:15,300 INFO L212 cStratifiedReduction]: Copied states 31 times. [2024-05-30 15:31:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 15:31:15,300 INFO L78 Accepts]: Start accepts. Automaton has currently 736 states, but on-demand construction may add more states Word has length 95 [2024-05-30 15:31:15,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 15:31:15,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 15:31:15,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 15:31:15,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 15:31:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -937489326, now seen corresponding path program 1 times [2024-05-30 15:31:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 15:31:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113594846] [2024-05-30 15:31:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 15:31:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 15:31:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 15:31:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 15:31:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113594846] [2024-05-30 15:31:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113594846] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 15:31:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473006147] [2024-05-30 15:31:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 15:31:15,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 15:31:15,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 15:31:15,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 15:31:15,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 15:31:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 15:31:15,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-30 15:31:15,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 15:31:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:16,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 15:31:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:16,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473006147] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 15:31:16,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 15:31:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-05-30 15:31:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576323529] [2024-05-30 15:31:16,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 15:31:16,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-30 15:31:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 15:31:16,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-30 15:31:16,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-05-30 15:31:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:16,283 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 15:31:16,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 15:31:16,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:16,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 15:31:16,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:16,284 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 15:31:16,602 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,602 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,602 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,606 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,606 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,606 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,612 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,612 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,612 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,619 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,620 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,620 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,625 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,626 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,626 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,627 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,627 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,627 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,634 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,634 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,634 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,638 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,638 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,638 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,640 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,641 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,641 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,645 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,645 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,645 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,651 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,651 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,651 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,652 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,652 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,652 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,657 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,660 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,660 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,660 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,665 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,666 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,666 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,672 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,672 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,672 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,677 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,677 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,677 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,678 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,678 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,678 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,687 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,687 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,687 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,692 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,692 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,692 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,699 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,699 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,699 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,706 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,707 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,707 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,713 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,714 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,714 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,714 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,726 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,726 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,726 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,731 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,731 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,731 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,739 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,739 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,739 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,747 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,748 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,748 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,755 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,755 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,755 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,756 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,756 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,756 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,759 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,759 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,759 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,770 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,771 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,771 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,775 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,775 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,775 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,781 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,781 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,781 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,788 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,788 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,788 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,794 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,794 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,794 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,795 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,795 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,795 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 15:31:16,808 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,808 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,808 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,812 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,813 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,813 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,818 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,818 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,825 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,825 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,825 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,834 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,834 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,834 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,840 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,840 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,840 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,841 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,841 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,841 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,858 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,858 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,858 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,861 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,861 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,861 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,863 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,863 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,863 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,895 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,895 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,896 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,897 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,897 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,897 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,900 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,900 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,900 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,904 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,904 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,905 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,913 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,913 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,914 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,917 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,917 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,917 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,918 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,918 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,918 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,926 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,926 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,926 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,928 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,928 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,928 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,929 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,929 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,929 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,939 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,940 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:31:16,940 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,942 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:31:16,942 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,942 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:31:16,990 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 700 states. [2024-05-30 15:31:16,990 INFO L212 cStratifiedReduction]: Copied states 76 times. [2024-05-30 15:31:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 15:31:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 15:31:16,990 INFO L78 Accepts]: Start accepts. Automaton has currently 873 states, but on-demand construction may add more states Word has length 97 [2024-05-30 15:31:16,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 15:31:17,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 15:31:17,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 15:31:17,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 15:31:17,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 15:31:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1692702037, now seen corresponding path program 1 times [2024-05-30 15:31:17,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 15:31:17,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642684673] [2024-05-30 15:31:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 15:31:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 15:31:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 15:31:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 15:31:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642684673] [2024-05-30 15:31:18,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642684673] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 15:31:18,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154190321] [2024-05-30 15:31:18,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 15:31:18,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 15:31:18,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 15:31:18,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 15:31:18,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 15:31:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 15:31:18,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 19 conjunts are in the unsatisfiable core [2024-05-30 15:31:18,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 15:31:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:34,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 15:31:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 15:31:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154190321] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 15:31:50,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 15:31:50,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2024-05-30 15:31:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327417812] [2024-05-30 15:31:50,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 15:31:50,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 15:31:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 15:31:50,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 15:31:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=546, Unknown=6, NotChecked=0, Total=702 [2024-05-30 15:31:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:50,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 15:31:50,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 15:31:50,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:50,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 15:31:50,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 15:31:50,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:31:50,008 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 15:31:53,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:31:58,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:32:00,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:32:02,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:32:04,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:32:07,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:32:16,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:32:25,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 15:32:27,389 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,389 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,389 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,392 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,392 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,392 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,396 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,396 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,396 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,398 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,398 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,398 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,400 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,400 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,400 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,404 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,404 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,404 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,408 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,408 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,408 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,409 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,409 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,409 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,417 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,417 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,417 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,418 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,418 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,418 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,421 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,421 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,462 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,463 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,463 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,464 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,464 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,465 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,467 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,467 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,467 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,468 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,468 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,468 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,469 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,470 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,470 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,472 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,472 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,472 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,475 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,475 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,475 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,476 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,476 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,476 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,480 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,481 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,481 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,481 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,481 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,481 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,484 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,484 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,486 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,487 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,487 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,488 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,489 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,489 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,492 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,492 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,492 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,495 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,495 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,495 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,497 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,498 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,498 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,498 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,498 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,498 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,503 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,503 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,503 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,507 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,508 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,508 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,511 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,512 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,512 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,516 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,516 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,516 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,519 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,519 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,519 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,520 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,520 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,526 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,526 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,526 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,529 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,529 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,529 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,533 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,533 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,533 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,537 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,537 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,537 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,541 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,541 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,541 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,541 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,541 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,541 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,543 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,548 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,548 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,548 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,559 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,559 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,559 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,570 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,570 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,570 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,576 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,576 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,579 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,579 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,579 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,581 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,581 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,581 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,585 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,585 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,585 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,589 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,589 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,590 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,590 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,590 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,600 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,600 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,601 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,608 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,609 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,609 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,663 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,663 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,663 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,666 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,666 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,666 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,668 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,668 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,668 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,671 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,671 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,671 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,674 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,674 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,674 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,675 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,675 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,675 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,712 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,713 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,717 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,717 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,717 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,759 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,760 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,760 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,764 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,764 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,764 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,769 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,770 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,770 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,771 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,771 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,771 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,799 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,799 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,799 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,801 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,801 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,801 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,803 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,804 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,804 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,805 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,805 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,805 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,806 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,806 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,806 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,809 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,809 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,809 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,812 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,812 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,812 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,812 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,812 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,812 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,817 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,817 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,817 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,818 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,818 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,819 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,819 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,820 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,840 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,840 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 15:32:27,840 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,841 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 15:32:27,841 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,842 INFO L395 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 15:32:27,889 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 936 states. [2024-05-30 15:32:27,889 INFO L212 cStratifiedReduction]: Copied states 183 times. [2024-05-30 15:32:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 15:32:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 15:32:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 15:32:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 15:32:27,889 INFO L78 Accepts]: Start accepts. Automaton has currently 1053 states, but on-demand construction may add more states Word has length 101 [2024-05-30 15:32:27,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 15:32:27,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 15:32:28,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 15:32:28,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 15:32:28,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 15:32:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -94158565, now seen corresponding path program 2 times [2024-05-30 15:32:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 15:32:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33285329] [2024-05-30 15:32:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 15:32:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 15:32:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 15:32:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 15:32:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 15:32:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33285329] [2024-05-30 15:32:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33285329] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 15:32:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558236423] [2024-05-30 15:32:28,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 15:32:28,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 15:32:28,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 15:32:28,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 15:32:28,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 15:41:45,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 15:41:45,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 15:41:45,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjunts are in the unsatisfiable core [2024-05-30 15:41:45,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 15:42:50,830 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 15:43:22,428 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 15:44:12,360 WARN L293 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 15:45:02,561 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (* (- 1) c_~x1~0))) (let ((.cse9 (div .cse8 4)) (.cse6 (div .cse8 2)) (.cse7 (mod (div c_~x2~0 2) 4294967296))) (let ((.cse2 (+ .cse7 1)) (.cse5 (+ (mod (* 4294967295 .cse6) 4294967296) 1)) (.cse1 (mod c_~x2~0 4294967296)) (.cse4 (mod c_~x3~0 4294967296)) (.cse0 (+ (mod (* 4294967295 .cse9) 4294967296) 1)) (.cse3 (mod c_~x1~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 .cse1) (<= .cse2 .cse3) (= .cse4 (mod c_~x4~0 4294967296)) (<= .cse5 .cse3) (= (mod .cse6 2) 0) (= .cse7 (mod (* 4294967295 (div .cse8 8)) 4294967296)) (<= .cse2 .cse1) (= (mod c_~x1~0 2) 0) (<= .cse5 .cse1) (= (mod .cse9 2) 0) (<= 1 .cse4) (<= .cse0 .cse3))))) is different from false Received shutdown request... [2024-05-30 15:45:49,712 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 [2024-05-30 15:45:49,713 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 15:45:49,713 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 15:45:50,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 15:45:50,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 15:45:50,913 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-30 15:45:50,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 15:45:50,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 15:45:50,921 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 102 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2024-05-30 15:45:50,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-30 15:45:50,941 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-05-30 15:45:50,944 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/5) [2024-05-30 15:45:50,945 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 15:45:50,945 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 15:45:50,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 03:45:50 BasicIcfg [2024-05-30 15:45:50,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 15:45:50,947 INFO L158 Benchmark]: Toolchain (without parser) took 879046.22ms. Allocated memory was 269.5MB in the beginning and 505.4MB in the end (delta: 235.9MB). Free memory was 197.8MB in the beginning and 210.3MB in the end (delta: -12.5MB). Peak memory consumption was 224.7MB. Max. memory is 8.0GB. [2024-05-30 15:45:50,947 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 15:45:50,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.04ms. Allocated memory is still 269.5MB. Free memory was 197.6MB in the beginning and 185.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 15:45:50,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.77ms. Allocated memory is still 269.5MB. Free memory was 185.9MB in the beginning and 237.6MB in the end (delta: -51.7MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2024-05-30 15:45:50,948 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 269.5MB. Free memory was 237.6MB in the beginning and 236.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 15:45:50,948 INFO L158 Benchmark]: RCFGBuilder took 341.02ms. Allocated memory is still 269.5MB. Free memory was 236.0MB in the beginning and 220.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-30 15:45:50,948 INFO L158 Benchmark]: TraceAbstraction took 878383.56ms. Allocated memory was 269.5MB in the beginning and 505.4MB in the end (delta: 235.9MB). Free memory was 219.3MB in the beginning and 210.3MB in the end (delta: 8.9MB). Peak memory consumption was 245.4MB. Max. memory is 8.0GB. [2024-05-30 15:45:50,950 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.11ms. Allocated memory is still 189.8MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.04ms. Allocated memory is still 269.5MB. Free memory was 197.6MB in the beginning and 185.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.77ms. Allocated memory is still 269.5MB. Free memory was 185.9MB in the beginning and 237.6MB in the end (delta: -51.7MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 269.5MB. Free memory was 237.6MB in the beginning and 236.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 341.02ms. Allocated memory is still 269.5MB. Free memory was 236.0MB in the beginning and 220.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 878383.56ms. Allocated memory was 269.5MB in the beginning and 505.4MB in the end (delta: 235.9MB). Free memory was 219.3MB in the beginning and 210.3MB in the end (delta: 8.9MB). Peak memory consumption was 245.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7076, independent: 6351, independent conditional: 6351, independent unconditional: 0, dependent: 725, dependent conditional: 725, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6351, independent: 6351, independent conditional: 6351, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6351, independent: 6351, independent conditional: 6351, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6351, independent: 6351, independent conditional: 0, independent unconditional: 6351, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6351, independent: 6351, independent conditional: 0, independent unconditional: 6351, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6351, independent: 6351, independent conditional: 0, independent unconditional: 6351, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6351, independent: 6351, independent conditional: 0, independent unconditional: 6351, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6351, independent: 6351, independent conditional: 0, independent unconditional: 6351, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6351, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6351, unknown conditional: 0, unknown unconditional: 6351] , Statistics on independence cache: Total cache size (in pairs): 6351, Positive cache size: 6351, Positive conditional cache size: 0, Positive unconditional cache size: 6351, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 725 - StatisticsResult: Reduction benchmarks 57.5ms Time before loop, 665.0ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 42, Reduction States: 450, Duplicate States: 31, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 27.7ms Time before loop, 306.1ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 42, Reduction States: 578, Duplicate States: 31, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 149.1ms Time before loop, 253.5ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 42, Reduction States: 593, Duplicate States: 31, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 252.2ms Time before loop, 453.5ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 5, overall guesses: 63, Reduction States: 700, Duplicate States: 76, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 37309.7ms Time before loop, 571.0ms Time in loop, 37.9s Time in total, Has Loop: 1, wrong guesses: 11, overall guesses: 81, Reduction States: 936, Duplicate States: 183, Protected Variables: 7 - StatisticsResult: Visitor Statistics States: 283, Transitions: 445, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 283, Transitions: 447, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 285, Transitions: 449, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 382, Transitions: 634, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 593, Transitions: 1052, Traversal time: 37.9s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 5, RedundantProofs: 3, ProvenStates: 481, Times there's more than one choice: 401, Avg number of choices: 2.9334719334719335 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 102 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 9 procedures, 141 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 878.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 40.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 12362 SizeOfPredicates, 23 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/9 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