/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-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 04:01:32,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 04:01:32,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 04:01:32,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 04:01:32,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 04:01:32,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 04:01:32,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 04:01:32,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 04:01:32,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 04:01:32,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 04:01:32,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 04:01:32,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 04:01:32,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 04:01:32,320 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 04:01:32,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 04:01:32,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 04:01:32,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 04:01:32,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 04:01:32,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 04:01:32,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 04:01:32,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 04:01:32,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 04:01:32,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 04:01:32,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 04:01:32,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 04:01:32,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 04:01:32,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 04:01:32,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 04:01:32,325 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 04:01:32,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 04:01:32,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 04:01:32,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 04:01:32,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 04:01:32,326 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 04:01:32,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 04:01:32,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 04:01:32,326 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 04:01:32,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 04:01:32,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 04:01:32,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 04:01:32,327 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 04:01:32,330 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-03 04:01:32,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 04:01:32,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 04:01:32,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 04:01:32,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 04:01:32,590 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 04:01:32,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-05-03 04:01:33,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 04:01:33,717 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 04:01:33,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-05-03 04:01:33,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/18852f90c/438f239b162841548ac46b6103820bfa/FLAG6d5fd9289 [2024-05-03 04:01:33,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/18852f90c/438f239b162841548ac46b6103820bfa [2024-05-03 04:01:33,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 04:01:33,742 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 04:01:33,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 04:01:33,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 04:01:33,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 04:01:33,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726302f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33, skipping insertion in model container [2024-05-03 04:01:33,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 04:01:33,885 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-exp2x4.wvr.c[2309,2322] [2024-05-03 04:01:33,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 04:01:33,896 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 04:01:33,911 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-exp2x4.wvr.c[2309,2322] [2024-05-03 04:01:33,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 04:01:33,922 INFO L206 MainTranslator]: Completed translation [2024-05-03 04:01:33,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33 WrapperNode [2024-05-03 04:01:33,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 04:01:33,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 04:01:33,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 04:01:33,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 04:01:33,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,949 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-05-03 04:01:33,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 04:01:33,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 04:01:33,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 04:01:33,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 04:01:33,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 04:01:33,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 04:01:33,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 04:01:33,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 04:01:33,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (1/1) ... [2024-05-03 04:01:33,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 04:01:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 04:01:33,999 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-03 04:01:34,001 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-03 04:01:34,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 04:01:34,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 04:01:34,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 04:01:34,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 04:01:34,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 04:01:34,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-03 04:01:34,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-03 04:01:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-03 04:01:34,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-03 04:01:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 04:01:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 04:01:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 04:01:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 04:01:34,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 04:01:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 04:01:34,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 04:01:34,038 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 04:01:34,118 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 04:01:34,126 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 04:01:34,271 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 04:01:34,280 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 04:01:34,280 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-03 04:01:34,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 04:01:34 BoogieIcfgContainer [2024-05-03 04:01:34,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 04:01:34,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 04:01:34,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 04:01:34,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 04:01:34,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 04:01:33" (1/3) ... [2024-05-03 04:01:34,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6d2490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 04:01:34, skipping insertion in model container [2024-05-03 04:01:34,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 04:01:33" (2/3) ... [2024-05-03 04:01:34,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6d2490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 04:01:34, skipping insertion in model container [2024-05-03 04:01:34,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 04:01:34" (3/3) ... [2024-05-03 04:01:34,287 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-05-03 04:01:34,293 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 04:01:34,301 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 04:01:34,301 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 04:01:34,301 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 04:01:34,360 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-03 04:01:34,392 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 04:01:34,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 04:01:34,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 04:01:34,395 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-03 04:01:34,398 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-03 04:01:34,427 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 04:01:34,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 04:01:34,438 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;@371f833a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 04:01:34,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 04:01:34,444 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:01:34,589 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,590 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,590 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,629 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,630 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,630 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,667 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,668 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,668 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,691 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,691 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,691 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,716 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,716 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,716 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,745 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,745 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,745 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,763 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,763 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,763 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,780 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,781 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,781 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,795 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,796 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,796 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,824 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,824 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,824 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,842 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,843 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,843 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,865 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,866 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,866 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,888 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,889 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,889 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,893 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,894 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,894 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,898 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,898 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,898 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,913 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,913 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,913 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,921 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,921 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,921 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,927 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,927 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,927 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,940 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,940 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,940 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,946 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,946 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,946 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,956 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,956 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,957 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,961 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,961 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,962 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,968 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,969 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,969 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,984 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,984 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,985 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:34,994 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:34,995 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:34,995 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,002 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,002 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,002 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,014 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,014 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,014 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,018 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,019 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,019 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,025 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,025 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,025 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,033 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,033 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,034 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,044 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,044 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,044 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,056 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,056 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,056 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,066 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,066 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,066 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,073 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,074 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,074 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,084 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,084 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,085 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,093 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,094 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,095 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,101 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,103 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,103 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,110 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,115 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,115 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,120 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,120 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,120 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,124 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,124 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,124 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,129 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,129 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,129 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,134 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,135 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,135 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,141 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,141 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,141 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,145 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,145 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,145 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,155 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,155 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,156 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,159 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,159 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,159 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,164 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,165 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,165 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,169 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,169 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,170 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,174 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,174 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,174 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,182 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,182 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,182 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,186 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,186 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,186 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,188 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,188 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,188 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,192 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,193 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,193 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,197 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,197 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,197 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,202 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,202 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,202 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,205 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,205 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,205 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,209 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,209 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,209 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,213 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,213 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,214 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,220 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,220 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,221 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,261 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,261 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,261 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,266 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,267 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,267 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,271 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,272 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,272 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,277 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,277 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,277 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,281 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,282 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,282 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,286 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,286 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,286 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,294 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,294 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,294 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,300 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,301 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,301 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,305 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,305 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,305 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,311 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,311 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,311 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,315 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,315 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,315 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,325 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,326 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,326 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,331 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,332 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,332 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,336 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,336 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,336 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,339 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,339 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,339 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,341 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,341 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,342 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,343 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,344 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,344 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,347 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,349 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,349 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,353 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,353 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,354 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,357 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,357 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,358 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,361 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,361 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,362 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,364 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,365 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,365 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,367 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,367 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,367 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,370 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,370 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,371 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,377 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,377 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,377 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,380 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,380 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,380 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,382 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,382 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,382 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,384 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 781 states. [2024-05-03 04:01:35,384 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 04:01:35,387 INFO L78 Accepts]: Start accepts. Automaton has currently 1025 states, but on-demand construction may add more states Word has length 95 [2024-05-03 04:01:35,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 04:01:35,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 04:01:35,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 04:01:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash -591886509, now seen corresponding path program 1 times [2024-05-03 04:01:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 04:01:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591411748] [2024-05-03 04:01:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:01:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 04:01:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:01:35,678 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-03 04:01:35,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 04:01:35,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591411748] [2024-05-03 04:01:35,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591411748] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 04:01:35,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 04:01:35,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 04:01:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818177139] [2024-05-03 04:01:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 04:01:35,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 04:01:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 04:01:35,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 04:01:35,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 04:01:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:35,707 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 04:01:35,708 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-03 04:01:35,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:35,709 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:01:35,751 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,752 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,752 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,756 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,756 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,756 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,761 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,762 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,762 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,765 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,766 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,766 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,770 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,772 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,772 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,777 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,778 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,779 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,793 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,793 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,794 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,798 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,799 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,799 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,805 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,806 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,806 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,810 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,811 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,811 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,815 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,815 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,815 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,821 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,821 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,821 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,826 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,826 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,826 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,829 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,829 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,829 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,832 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,832 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,832 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,834 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,834 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,834 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,840 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,840 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,840 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,844 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,844 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,844 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,848 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,849 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,849 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,853 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,853 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,853 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,856 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,856 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,856 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,858 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,858 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,858 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,861 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,861 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,862 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,865 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,865 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,865 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,870 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,870 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,870 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,874 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,874 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,874 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,878 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,878 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,878 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,886 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,886 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,886 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,892 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,892 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,892 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,897 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,897 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,897 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,902 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,903 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,906 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,910 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,911 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,911 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,916 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,916 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,916 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,920 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,920 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,920 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,925 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,925 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,925 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,930 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,930 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,930 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,936 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,936 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,936 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,939 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,939 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,940 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,945 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,945 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,945 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,948 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,948 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,948 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,954 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,955 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,955 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,960 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,960 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,960 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,964 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,964 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,964 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,968 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,968 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,968 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,972 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,972 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,972 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,975 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,975 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,975 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,978 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,979 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,979 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,983 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,983 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,983 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,988 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,988 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,988 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,990 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,990 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,991 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,993 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,993 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,993 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,995 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,995 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,995 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:35,997 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:35,998 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:35,998 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,001 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,002 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,002 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,005 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,005 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,005 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,008 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,008 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,008 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,011 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,011 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,012 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,014 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,014 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,014 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,048 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,048 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,048 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,059 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,060 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,060 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,064 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,064 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,065 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,068 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,068 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,068 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,073 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,073 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,073 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,076 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,076 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,076 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,080 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,080 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,080 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,085 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,085 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,085 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,090 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,090 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,091 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,094 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,095 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,095 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,100 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,100 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,100 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,105 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,105 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,105 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,112 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,112 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,112 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,117 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,118 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,118 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,130 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,131 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,131 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,133 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,133 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,133 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,135 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,135 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,135 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,137 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,137 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,137 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,140 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,140 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,140 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,143 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,143 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,143 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,146 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,147 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,147 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,149 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,149 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,149 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,151 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,151 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,151 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,153 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,153 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,153 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,156 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,156 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,156 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,159 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,159 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,159 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,163 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,163 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,163 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,165 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,165 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,165 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,170 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 973 states. [2024-05-03 04:01:36,171 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 04:01:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:36,172 INFO L78 Accepts]: Start accepts. Automaton has currently 1321 states, but on-demand construction may add more states Word has length 93 [2024-05-03 04:01:36,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 04:01:36,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 04:01:36,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 04:01:36,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 04:01:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2010563544, now seen corresponding path program 1 times [2024-05-03 04:01:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 04:01:36,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125157671] [2024-05-03 04:01:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:01:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 04:01:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:01:36,785 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-03 04:01:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 04:01:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125157671] [2024-05-03 04:01:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125157671] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 04:01:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 04:01:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-03 04:01:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123113282] [2024-05-03 04:01:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 04:01:36,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 04:01:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 04:01:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 04:01:36,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-03 04:01:36,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:36,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 04:01:36,788 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-03 04:01:36,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:36,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:36,789 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:01:36,939 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,939 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,939 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,943 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,943 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,943 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,947 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,948 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,948 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,952 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,952 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,952 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,957 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,957 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,957 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,962 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,963 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,963 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,967 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,968 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,968 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,971 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,971 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,971 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,976 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,976 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,976 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,979 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,979 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,979 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,983 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,983 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,983 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,988 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,988 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,989 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,995 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,995 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,995 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:36,997 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:36,998 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:36,998 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,000 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,000 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,000 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,002 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,002 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,002 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,007 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,007 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,007 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,011 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,011 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,011 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,015 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,015 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,015 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,021 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,021 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,021 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,025 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,025 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,025 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,028 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,029 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,029 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,032 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,032 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,032 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,037 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,037 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,037 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,049 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,050 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,050 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,054 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,054 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,054 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,059 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,059 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,059 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,062 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,063 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,063 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,067 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,067 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,067 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,073 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,073 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,073 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,081 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,081 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,081 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,086 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,086 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,086 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,092 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,092 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,092 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,097 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,097 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,097 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,102 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,103 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,103 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,109 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,109 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,109 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,117 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,117 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,117 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,120 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,120 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,120 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,123 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,123 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,123 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,125 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,125 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,125 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,128 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,128 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,128 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,132 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,132 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,132 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,136 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,136 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,136 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,139 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,139 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,139 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,141 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,142 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,142 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,144 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,144 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,144 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,147 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,147 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,147 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,151 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,151 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,151 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,158 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,158 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,158 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,160 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:37,160 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:37,160 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:37,182 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 739 states. [2024-05-03 04:01:37,182 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 04:01:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:01:37,183 INFO L78 Accepts]: Start accepts. Automaton has currently 1039 states, but on-demand construction may add more states Word has length 96 [2024-05-03 04:01:37,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 04:01:37,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 04:01:37,186 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 04:01:37,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 04:01:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash -742185964, now seen corresponding path program 1 times [2024-05-03 04:01:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 04:01:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625880287] [2024-05-03 04:01:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:01:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 04:01:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:01:37,586 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-03 04:01:37,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 04:01:37,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625880287] [2024-05-03 04:01:37,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625880287] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 04:01:37,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130738092] [2024-05-03 04:01:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:01:37,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 04:01:37,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 04:01:37,626 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-03 04:01:37,628 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-03 04:01:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:01:37,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-03 04:01:37,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 04:01:37,949 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-03 04:01:37,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 04:01:38,130 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-03 04:01:38,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130738092] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 04:01:38,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 04:01:38,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-05-03 04:01:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056767608] [2024-05-03 04:01:38,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 04:01:38,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-03 04:01:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 04:01:38,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-03 04:01:38,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-05-03 04:01:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:38,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 04:01:38,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.142857142857142) internal successors, (170), 14 states have internal predecessors, (170), 0 states have call successors, (0), 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-03 04:01:38,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:38,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:01:38,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:38,134 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:01:38,417 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,417 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,417 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,421 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,421 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,421 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,425 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,426 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,426 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,429 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,429 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,429 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,433 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,434 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,434 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,439 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,439 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,439 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,443 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,444 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,444 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,448 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,448 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,448 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,451 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,451 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,451 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,453 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,453 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,453 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,456 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,456 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,456 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,460 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,461 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,461 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,465 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,465 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,465 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,468 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,468 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,468 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,472 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,472 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,472 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,475 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,475 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,475 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,479 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,479 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,479 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,483 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,484 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,484 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,490 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,490 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,490 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,495 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,495 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,495 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,500 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,500 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,500 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,504 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,504 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,504 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,509 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,509 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,509 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,514 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,514 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,514 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,521 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,521 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,521 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,526 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,526 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,526 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,532 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,532 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,532 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,537 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,537 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,537 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,542 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,542 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,542 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,548 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,548 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,548 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,553 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,553 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,553 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,557 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,557 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,557 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,562 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,562 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,562 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,566 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,566 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,567 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,571 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,572 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,572 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,577 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,577 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,577 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,591 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,591 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,591 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,595 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,595 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,595 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,600 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,600 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,600 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,603 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,603 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,603 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,608 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,608 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,608 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,613 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,613 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,613 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 04:01:38,619 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,619 INFO L369 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-03 04:01:38,619 INFO L370 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-03 04:01:38,623 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,623 INFO L369 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-03 04:01:38,623 INFO L370 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-03 04:01:38,629 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,629 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,629 INFO L370 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-03 04:01:38,634 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,634 INFO L369 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-03 04:01:38,634 INFO L370 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-03 04:01:38,638 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,638 INFO L369 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-03 04:01:38,638 INFO L370 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-03 04:01:38,643 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,643 INFO L369 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-03 04:01:38,643 INFO L370 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-03 04:01:38,649 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,649 INFO L369 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-03 04:01:38,649 INFO L370 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-03 04:01:38,675 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,675 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,675 INFO L370 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-03 04:01:38,678 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,678 INFO L369 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-03 04:01:38,678 INFO L370 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-03 04:01:38,681 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,682 INFO L369 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-03 04:01:38,682 INFO L370 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-03 04:01:38,684 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,684 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,684 INFO L370 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-03 04:01:38,686 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,686 INFO L369 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-03 04:01:38,686 INFO L370 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-03 04:01:38,688 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,688 INFO L369 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-03 04:01:38,689 INFO L370 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-03 04:01:38,691 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,692 INFO L369 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-03 04:01:38,692 INFO L370 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-03 04:01:38,695 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,695 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,695 INFO L370 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-03 04:01:38,698 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,698 INFO L369 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-03 04:01:38,698 INFO L370 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-03 04:01:38,705 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,705 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:01:38,705 INFO L370 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-03 04:01:38,707 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,707 INFO L369 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-03 04:01:38,707 INFO L370 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-03 04:01:38,708 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:01:38,708 INFO L369 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-03 04:01:38,708 INFO L370 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-03 04:01:38,749 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 810 states. [2024-05-03 04:01:38,749 INFO L212 cStratifiedReduction]: Copied states 23 times. [2024-05-03 04:01:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:01:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:01:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:01:38,750 INFO L78 Accepts]: Start accepts. Automaton has currently 1191 states, but on-demand construction may add more states Word has length 99 [2024-05-03 04:01:38,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 04:01:38,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-03 04:01:38,956 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-03 04:01:38,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 04:01:38,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 04:01:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 65347739, now seen corresponding path program 1 times [2024-05-03 04:01:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 04:01:38,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51454836] [2024-05-03 04:01:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:01:38,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 04:01:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:01:39,772 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-03 04:01:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 04:01:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51454836] [2024-05-03 04:01:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51454836] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 04:01:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811710021] [2024-05-03 04:01:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:01:39,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 04:01:39,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 04:01:39,773 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-03 04:01:39,800 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-03 04:01:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:01:40,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-03 04:01:40,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 04:02:56,871 WARN L293 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 04:04:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 04:04:20,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 04:05:28,036 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-03 04:05:28,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811710021] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 04:05:28,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 04:05:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-05-03 04:05:28,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576910160] [2024-05-03 04:05:28,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 04:05:28,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-05-03 04:05:28,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 04:05:28,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-05-03 04:05:28,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=871, Unknown=51, NotChecked=0, Total=1056 [2024-05-03 04:05:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:05:28,038 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 04:05:28,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.181818181818182) internal successors, (204), 33 states have internal predecessors, (204), 0 states have call successors, (0), 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-03 04:05:28,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:05:28,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:05:28,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:05:28,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:05:28,039 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:05:30,636 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-03 04:05:32,708 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-03 04:05:36,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:09,587 WARN L293 SmtUtils]: Spent 13.99s on a formula simplification. DAG size of input: 69 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 04:06:11,609 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-03 04:06:13,665 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-03 04:06:15,683 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-03 04:06:17,763 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-03 04:06:20,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:22,680 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-03 04:06:24,699 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-03 04:06:26,703 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-03 04:06:30,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:32,114 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-03 04:06:35,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:37,937 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-03 04:06:39,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:42,045 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-03 04:06:44,059 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-03 04:06:46,135 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-03 04:06:48,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:49,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:51,333 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-03 04:06:54,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:06:57,679 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-03 04:06:59,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:07:01,761 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-03 04:07:03,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:07:05,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:07:30,132 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 04:07:33,095 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-03 04:07:35,250 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-03 04:07:37,540 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-03 04:07:40,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:07:42,932 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-03 04:07:45,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:07:47,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:07:49,378 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-03 04:07:52,183 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-03 04:07:54,950 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-03 04:07:56,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:07:58,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:00,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:02,564 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-03 04:08:04,758 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-03 04:08:06,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:08,903 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-03 04:08:11,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:13,900 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-03 04:08:15,941 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-03 04:08:17,956 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-03 04:08:20,321 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-03 04:08:22,869 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-03 04:08:24,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:26,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:28,077 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-03 04:08:30,082 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-03 04:08:31,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:33,116 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-03 04:08:34,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:36,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:38,139 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-03 04:08:40,663 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-03 04:08:42,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:44,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:47,371 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-03 04:08:49,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:08:51,537 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-03 04:08:53,751 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-03 04:08:55,777 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-03 04:08:58,460 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-03 04:09:00,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:02,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:04,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:06,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:09,152 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-03 04:09:23,227 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification. DAG size of input: 68 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 04:09:25,231 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-03 04:09:27,328 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-03 04:09:30,473 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-03 04:09:32,478 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-03 04:09:34,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:36,661 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-03 04:09:38,666 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-03 04:09:40,676 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-03 04:09:41,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:43,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:45,954 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-03 04:09:47,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:50,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:52,576 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-03 04:09:54,865 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-03 04:09:56,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:09:58,880 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-03 04:10:00,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:10:02,421 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-03 04:10:05,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:10:07,125 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-03 04:10:08,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:10:11,504 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-03 04:10:13,561 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-03 04:10:14,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:10:16,857 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-03 04:10:20,246 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-03 04:10:22,582 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-03 04:10:25,158 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-03 04:10:27,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:10:29,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:10:31,328 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-03 04:10:34,633 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,634 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:34,634 INFO L370 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-03 04:10:34,636 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,636 INFO L369 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-03 04:10:34,636 INFO L370 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-03 04:10:34,669 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,669 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:34,669 INFO L370 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-03 04:10:34,671 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,671 INFO L369 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-03 04:10:34,671 INFO L370 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-03 04:10:34,673 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,673 INFO L369 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-03 04:10:34,673 INFO L370 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-03 04:10:34,676 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,676 INFO L369 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-03 04:10:34,676 INFO L370 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-03 04:10:34,679 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,679 INFO L369 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-03 04:10:34,679 INFO L370 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-03 04:10:34,682 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,682 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:34,682 INFO L370 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-03 04:10:34,689 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,689 INFO L369 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-03 04:10:34,689 INFO L370 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-03 04:10:34,737 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,737 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:34,737 INFO L370 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-03 04:10:34,739 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,739 INFO L369 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-03 04:10:34,739 INFO L370 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-03 04:10:34,740 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,740 INFO L369 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-03 04:10:34,740 INFO L370 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-03 04:10:34,742 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,742 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:34,742 INFO L370 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-03 04:10:34,743 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,743 INFO L369 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-03 04:10:34,743 INFO L370 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-03 04:10:34,744 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,744 INFO L369 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-03 04:10:34,745 INFO L370 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-03 04:10:34,746 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,746 INFO L369 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-03 04:10:34,746 INFO L370 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-03 04:10:34,749 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,749 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:34,749 INFO L370 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-03 04:10:34,750 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,750 INFO L369 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-03 04:10:34,750 INFO L370 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-03 04:10:34,752 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,752 INFO L369 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-03 04:10:34,752 INFO L370 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-03 04:10:34,754 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,754 INFO L369 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-03 04:10:34,754 INFO L370 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-03 04:10:34,756 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,756 INFO L369 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-03 04:10:34,756 INFO L370 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-03 04:10:34,757 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,757 INFO L369 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-03 04:10:34,757 INFO L370 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-03 04:10:34,760 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,760 INFO L369 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-03 04:10:34,760 INFO L370 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-03 04:10:34,762 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,762 INFO L369 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-03 04:10:34,762 INFO L370 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-03 04:10:34,765 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,765 INFO L369 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-03 04:10:34,765 INFO L370 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-03 04:10:34,767 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,767 INFO L369 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-03 04:10:34,767 INFO L370 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-03 04:10:34,770 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,771 INFO L369 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-03 04:10:34,771 INFO L370 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-03 04:10:34,773 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,773 INFO L369 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-03 04:10:34,773 INFO L370 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-03 04:10:34,775 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,776 INFO L369 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-03 04:10:34,776 INFO L370 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-03 04:10:34,778 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,779 INFO L369 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-03 04:10:34,779 INFO L370 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-03 04:10:34,782 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,782 INFO L369 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-03 04:10:34,782 INFO L370 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-03 04:10:34,784 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,784 INFO L369 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-03 04:10:34,784 INFO L370 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-03 04:10:34,788 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,788 INFO L369 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-03 04:10:34,788 INFO L370 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-03 04:10:34,790 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,790 INFO L369 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-03 04:10:34,790 INFO L370 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-03 04:10:34,793 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,793 INFO L369 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-03 04:10:34,793 INFO L370 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-03 04:10:34,797 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,797 INFO L369 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-03 04:10:34,797 INFO L370 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-03 04:10:34,799 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,799 INFO L369 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-03 04:10:34,799 INFO L370 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-03 04:10:34,801 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,801 INFO L369 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-03 04:10:34,801 INFO L370 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-03 04:10:34,803 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,803 INFO L369 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-03 04:10:34,803 INFO L370 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-03 04:10:34,805 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,805 INFO L369 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-03 04:10:34,805 INFO L370 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-03 04:10:34,807 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,807 INFO L369 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-03 04:10:34,807 INFO L370 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-03 04:10:34,809 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,809 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:34,810 INFO L370 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-03 04:10:34,813 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,813 INFO L369 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-03 04:10:34,813 INFO L370 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-03 04:10:34,816 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,816 INFO L369 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-03 04:10:34,816 INFO L370 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-03 04:10:34,818 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,818 INFO L369 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-03 04:10:34,818 INFO L370 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-03 04:10:34,820 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,820 INFO L369 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-03 04:10:34,820 INFO L370 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-03 04:10:34,822 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,822 INFO L369 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-03 04:10:34,822 INFO L370 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-03 04:10:34,825 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,825 INFO L369 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-03 04:10:34,825 INFO L370 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-03 04:10:34,826 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,826 INFO L369 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-03 04:10:34,826 INFO L370 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-03 04:10:34,838 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,838 INFO L369 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-03 04:10:34,838 INFO L370 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-03 04:10:34,841 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,841 INFO L369 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-03 04:10:34,841 INFO L370 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-03 04:10:34,845 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,845 INFO L369 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-03 04:10:34,845 INFO L370 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-03 04:10:34,847 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,847 INFO L369 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-03 04:10:34,847 INFO L370 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-03 04:10:34,850 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,851 INFO L369 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-03 04:10:34,851 INFO L370 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-03 04:10:34,854 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:34,854 INFO L369 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-03 04:10:34,854 INFO L370 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-03 04:10:35,146 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,146 INFO L369 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-03 04:10:35,146 INFO L370 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-03 04:10:35,148 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,148 INFO L369 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-03 04:10:35,148 INFO L370 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-03 04:10:35,149 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,149 INFO L369 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-03 04:10:35,150 INFO L370 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-03 04:10:35,151 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,152 INFO L369 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-03 04:10:35,152 INFO L370 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-03 04:10:35,154 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,154 INFO L369 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-03 04:10:35,154 INFO L370 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-03 04:10:35,158 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,158 INFO L369 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-03 04:10:35,158 INFO L370 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-03 04:10:35,167 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,167 INFO L369 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-03 04:10:35,167 INFO L370 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-03 04:10:35,168 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,168 INFO L369 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-03 04:10:35,168 INFO L370 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-03 04:10:35,169 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,169 INFO L369 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-03 04:10:35,169 INFO L370 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-03 04:10:35,170 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,170 INFO L369 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-03 04:10:35,170 INFO L370 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-03 04:10:35,172 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,172 INFO L369 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-03 04:10:35,172 INFO L370 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-03 04:10:35,174 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,174 INFO L369 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-03 04:10:35,174 INFO L370 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-03 04:10:35,175 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,175 INFO L369 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-03 04:10:35,175 INFO L370 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-03 04:10:35,177 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,177 INFO L369 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-03 04:10:35,177 INFO L370 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-03 04:10:35,178 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,178 INFO L369 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-03 04:10:35,178 INFO L370 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-03 04:10:35,180 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,180 INFO L369 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-03 04:10:35,180 INFO L370 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-03 04:10:35,182 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,182 INFO L369 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-03 04:10:35,182 INFO L370 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-03 04:10:35,184 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,184 INFO L369 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-03 04:10:35,184 INFO L370 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-03 04:10:35,187 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,187 INFO L369 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-03 04:10:35,187 INFO L370 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-03 04:10:35,189 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,189 INFO L369 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-03 04:10:35,189 INFO L370 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-03 04:10:35,192 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,192 INFO L369 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-03 04:10:35,192 INFO L370 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-03 04:10:35,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,194 INFO L369 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-03 04:10:35,194 INFO L370 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-03 04:10:35,197 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,197 INFO L369 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-03 04:10:35,197 INFO L370 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-03 04:10:35,199 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,199 INFO L369 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-03 04:10:35,199 INFO L370 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-03 04:10:35,202 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,202 INFO L369 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-03 04:10:35,202 INFO L370 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-03 04:10:35,204 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,205 INFO L369 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-03 04:10:35,205 INFO L370 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-03 04:10:35,209 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,209 INFO L369 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-03 04:10:35,209 INFO L370 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-03 04:10:35,211 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,212 INFO L369 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-03 04:10:35,212 INFO L370 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-03 04:10:35,214 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,215 INFO L369 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-03 04:10:35,215 INFO L370 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-03 04:10:35,218 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,218 INFO L369 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-03 04:10:35,218 INFO L370 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-03 04:10:35,219 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,220 INFO L369 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-03 04:10:35,220 INFO L370 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-03 04:10:35,221 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,221 INFO L369 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-03 04:10:35,221 INFO L370 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-03 04:10:35,223 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,223 INFO L369 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-03 04:10:35,223 INFO L370 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-03 04:10:35,224 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,225 INFO L369 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-03 04:10:35,225 INFO L370 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-03 04:10:35,227 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,227 INFO L369 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-03 04:10:35,227 INFO L370 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-03 04:10:35,229 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,229 INFO L369 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-03 04:10:35,229 INFO L370 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-03 04:10:35,494 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,495 INFO L369 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-03 04:10:35,495 INFO L370 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-03 04:10:35,496 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,496 INFO L369 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-03 04:10:35,496 INFO L370 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-03 04:10:35,498 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,498 INFO L369 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-03 04:10:35,498 INFO L370 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-03 04:10:35,500 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,500 INFO L369 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-03 04:10:35,500 INFO L370 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-03 04:10:35,502 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,502 INFO L369 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-03 04:10:35,502 INFO L370 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-03 04:10:35,503 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,503 INFO L369 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-03 04:10:35,503 INFO L370 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-03 04:10:35,554 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,555 INFO L369 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-03 04:10:35,555 INFO L370 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-03 04:10:35,557 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,558 INFO L369 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-03 04:10:35,558 INFO L370 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-03 04:10:35,560 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,560 INFO L369 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-03 04:10:35,560 INFO L370 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-03 04:10:35,562 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,563 INFO L369 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-03 04:10:35,563 INFO L370 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-03 04:10:35,566 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,566 INFO L369 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-03 04:10:35,566 INFO L370 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-03 04:10:35,568 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,568 INFO L369 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-03 04:10:35,568 INFO L370 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-03 04:10:35,600 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,600 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:35,600 INFO L370 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-03 04:10:35,602 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,602 INFO L369 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-03 04:10:35,602 INFO L370 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-03 04:10:35,604 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,604 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:35,604 INFO L370 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-03 04:10:35,605 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,605 INFO L369 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-03 04:10:35,605 INFO L370 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-03 04:10:35,606 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,606 INFO L369 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-03 04:10:35,606 INFO L370 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-03 04:10:35,608 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,608 INFO L369 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-03 04:10:35,608 INFO L370 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-03 04:10:35,610 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,610 INFO L369 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-03 04:10:35,610 INFO L370 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-03 04:10:35,612 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,612 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:35,612 INFO L370 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-03 04:10:35,613 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,613 INFO L369 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-03 04:10:35,613 INFO L370 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-03 04:10:35,639 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,639 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:10:35,640 INFO L370 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-03 04:10:35,641 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,641 INFO L369 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-03 04:10:35,641 INFO L370 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-03 04:10:35,641 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:10:35,641 INFO L369 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-03 04:10:35,641 INFO L370 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-03 04:10:35,707 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1343 states. [2024-05-03 04:10:35,707 INFO L212 cStratifiedReduction]: Copied states 56 times. [2024-05-03 04:10:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:10:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:10:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:10:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-03 04:10:35,708 INFO L78 Accepts]: Start accepts. Automaton has currently 1869 states, but on-demand construction may add more states Word has length 102 [2024-05-03 04:10:35,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 04:10:35,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-03 04:10:35,908 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-03 04:10:35,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 04:10:35,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 04:10:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -59480185, now seen corresponding path program 2 times [2024-05-03 04:10:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 04:10:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028784716] [2024-05-03 04:10:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:10:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 04:10:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:10:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 04:10:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 04:10:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028784716] [2024-05-03 04:10:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028784716] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 04:10:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435578455] [2024-05-03 04:10:36,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 04:10:36,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 04:10:36,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 04:10:36,445 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-03 04:10:36,446 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-03 04:11:00,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 04:11:00,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 04:11:00,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2024-05-03 04:11:00,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 04:11:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 04:11:12,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 04:11:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 04:11:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435578455] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 04:11:18,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 04:11:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 28 [2024-05-03 04:11:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163544274] [2024-05-03 04:11:18,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 04:11:18,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-03 04:11:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 04:11:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-03 04:11:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=669, Unknown=6, NotChecked=0, Total=756 [2024-05-03 04:11:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:11:18,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 04:11:18,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.964285714285714) internal successors, (195), 28 states have internal predecessors, (195), 0 states have call successors, (0), 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-03 04:11:18,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:11:18,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:11:18,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:11:18,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-03 04:11:18,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:11:18,778 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:11:25,184 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-03 04:11:35,792 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-03 04:11:39,021 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-03 04:11:48,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:11:50,169 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-03 04:11:53,525 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-03 04:11:59,045 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-03 04:12:03,045 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-03 04:12:05,110 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-03 04:12:12,018 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-03 04:12:18,510 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-03 04:12:20,694 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-03 04:12:20,935 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,936 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:12:20,936 INFO L370 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-03 04:12:20,939 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,939 INFO L369 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-03 04:12:20,940 INFO L370 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-03 04:12:20,941 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,941 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:12:20,941 INFO L370 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-03 04:12:20,942 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,942 INFO L369 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-03 04:12:20,942 INFO L370 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-03 04:12:20,943 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,944 INFO L369 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-03 04:12:20,944 INFO L370 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-03 04:12:20,945 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,945 INFO L369 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-03 04:12:20,945 INFO L370 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-03 04:12:20,947 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,947 INFO L369 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-03 04:12:20,947 INFO L370 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-03 04:12:20,949 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,949 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:12:20,949 INFO L370 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-03 04:12:20,949 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,949 INFO L369 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-03 04:12:20,949 INFO L370 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-03 04:12:20,969 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,970 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:12:20,970 INFO L370 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-03 04:12:20,971 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,971 INFO L369 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-03 04:12:20,971 INFO L370 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-03 04:12:20,971 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:12:20,971 INFO L369 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-03 04:12:20,971 INFO L370 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-03 04:12:21,023 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 560 states. [2024-05-03 04:12:21,024 INFO L212 cStratifiedReduction]: Copied states 18 times. [2024-05-03 04:12:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:12:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:12:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:12:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-03 04:12:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 04:12:21,024 INFO L78 Accepts]: Start accepts. Automaton has currently 581 states, but on-demand construction may add more states Word has length 108 [2024-05-03 04:12:21,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 04:12:21,032 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-03 04:12:21,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 04:12:21,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 04:12:21,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 04:12:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 972991028, now seen corresponding path program 3 times [2024-05-03 04:12:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 04:12:21,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771624528] [2024-05-03 04:12:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:12:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 04:12:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:12:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 04:12:21,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 04:12:21,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771624528] [2024-05-03 04:12:21,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771624528] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 04:12:21,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074937245] [2024-05-03 04:12:21,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 04:12:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 04:12:21,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 04:12:21,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 04:12:21,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Received shutdown request... [2024-05-03 04:16:11,717 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-03 04:16:11,718 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-03 04:16:11,737 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 04:16:12,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-03 04:16:12,738 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 0 [2024-05-03 04:16:12,938 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2024-05-03 04:16:12,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2024-05-03 04:16:12,945 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 04:16:12,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-05-03 04:16:12,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-05-03 04:16:12,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596395737] [2024-05-03 04:16:12,945 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-05-03 04:16:12,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-03 04:16:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 04:16:12,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-03 04:16:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-05-03 04:16:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:16:12,946 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 04:16:12,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 0 states have call successors, (0), 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-03 04:16:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:16:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:16:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:16:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-03 04:16:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-03 04:16:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:16:12,947 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:16:12,947 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1 states. [2024-05-03 04:16:12,947 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 04:16:12,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-03 04:16:12,947 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2024-05-03 04:16:12,949 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 04:16:12,958 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-05-03 04:16:12,959 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/5) [2024-05-03 04:16:12,960 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 04:16:12,961 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 04:16:12,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 04:16:12 BasicIcfg [2024-05-03 04:16:12,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 04:16:12,962 INFO L158 Benchmark]: Toolchain (without parser) took 879220.35ms. Allocated memory was 242.2MB in the beginning and 501.2MB in the end (delta: 259.0MB). Free memory was 172.6MB in the beginning and 374.4MB in the end (delta: -201.8MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2024-05-03 04:16:12,963 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 242.2MB. Free memory is still 211.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 04:16:12,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.42ms. Allocated memory is still 242.2MB. Free memory was 172.6MB in the beginning and 160.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-03 04:16:12,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 242.2MB. Free memory was 160.6MB in the beginning and 158.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 04:16:12,963 INFO L158 Benchmark]: Boogie Preprocessor took 20.46ms. Allocated memory is still 242.2MB. Free memory was 158.9MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 04:16:12,963 INFO L158 Benchmark]: RCFGBuilder took 309.65ms. Allocated memory is still 242.2MB. Free memory was 157.5MB in the beginning and 141.1MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-03 04:16:12,963 INFO L158 Benchmark]: TraceAbstraction took 878679.90ms. Allocated memory was 242.2MB in the beginning and 501.2MB in the end (delta: 259.0MB). Free memory was 140.1MB in the beginning and 374.4MB in the end (delta: -234.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-05-03 04:16:12,964 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.12ms. Allocated memory is still 242.2MB. Free memory is still 211.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.42ms. Allocated memory is still 242.2MB. Free memory was 172.6MB in the beginning and 160.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 242.2MB. Free memory was 160.6MB in the beginning and 158.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.46ms. Allocated memory is still 242.2MB. Free memory was 158.9MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 309.65ms. Allocated memory is still 242.2MB. Free memory was 157.5MB in the beginning and 141.1MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 878679.90ms. Allocated memory was 242.2MB in the beginning and 501.2MB in the end (delta: 259.0MB). Free memory was 140.1MB in the beginning and 374.4MB in the end (delta: -234.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8131, independent: 7572, independent conditional: 7572, independent unconditional: 0, dependent: 559, dependent conditional: 559, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7572, independent: 7572, independent conditional: 7572, 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: 7572, independent: 7572, independent conditional: 7572, 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: 7572, independent: 7572, independent conditional: 0, independent unconditional: 7572, 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: 7572, independent: 7572, independent conditional: 0, independent unconditional: 7572, 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: 7572, independent: 7572, independent conditional: 0, independent unconditional: 7572, 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: 7572, independent: 7572, independent conditional: 0, independent unconditional: 7572, 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: 7572, independent: 7572, independent conditional: 0, independent unconditional: 7572, 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: 7572, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7572, unknown conditional: 0, unknown unconditional: 7572] , Statistics on independence cache: Total cache size (in pairs): 7572, Positive cache size: 7572, Positive conditional cache size: 0, Positive unconditional cache size: 7572, 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: 559 - StatisticsResult: Reduction benchmarks 29.3ms Time before loop, 909.9ms Time in loop, 0.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 90, Reduction States: 781, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 30.2ms Time before loop, 430.7ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 90, Reduction States: 973, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 123.2ms Time before loop, 270.0ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 54, Reduction States: 739, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 252.1ms Time before loop, 363.0ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 5, overall guesses: 65, Reduction States: 810, Duplicate States: 23, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 306461.4ms Time before loop, 1206.4ms Time in loop, 307.7s Time in total, Has Loop: 1, wrong guesses: 11, overall guesses: 119, Reduction States: 1343, Duplicate States: 56, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 51134.9ms Time before loop, 11109.9ms Time in loop, 62.2s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 16, Reduction States: 560, Duplicate States: 18, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 0.2ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 614, Transitions: 821, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 614, Transitions: 823, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 401, Transitions: 524, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 463, Transitions: 628, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 937, Transitions: 1364, Traversal time: 307.7s - StatisticsResult: Visitor Statistics States: 204, Transitions: 261, Traversal time: 62.2s - StatisticsResult: Visitor Statistics States: 1, Transitions: 0, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 15, RedundantProofs: 6, ProvenStates: 471, Times there's more than one choice: 364, Avg number of choices: 2.94692144373673 - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 9 procedures, 149 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 878.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 372.3s, 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: 64, 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, 25.0s SatisfiabilityAnalysisTime, 248.8s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1175 ConstructedInterpolants, 0 QuantifiedInterpolants, 17945 SizeOfPredicates, 35 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/44 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