/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/popl20-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 05:27:34,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 05:27:34,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 05:27:34,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 05:27:34,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 05:27:34,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 05:27:34,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 05:27:34,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 05:27:34,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 05:27:34,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 05:27:34,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 05:27:34,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 05:27:34,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 05:27:34,113 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 05:27:34,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 05:27:34,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 05:27:34,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 05:27:34,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 05:27:34,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 05:27:34,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 05:27:34,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 05:27:34,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 05:27:34,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 05:27:34,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 05:27:34,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 05:27:34,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 05:27:34,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 05:27:34,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 05:27:34,116 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 05:27:34,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 05:27:34,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:27:34,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 05:27:34,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 05:27:34,118 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 05:27:34,119 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 05:27:34,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 05:27:34,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 05:27:34,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 05:27:34,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 05:27:34,370 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 05:27:34,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2024-05-03 05:27:35,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 05:27:35,616 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 05:27:35,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2024-05-03 05:27:35,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/920f8a870/aeb28e40ba88455294c653164327d4c5/FLAG53d8d034d [2024-05-03 05:27:35,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/920f8a870/aeb28e40ba88455294c653164327d4c5 [2024-05-03 05:27:35,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 05:27:35,639 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 05:27:35,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 05:27:35,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 05:27:35,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 05:27:35,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678972bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35, skipping insertion in model container [2024-05-03 05:27:35,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,666 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 05:27:35,778 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/popl20-simple-queue.wvr.c[2438,2451] [2024-05-03 05:27:35,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:27:35,790 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 05:27:35,803 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/popl20-simple-queue.wvr.c[2438,2451] [2024-05-03 05:27:35,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:27:35,816 INFO L206 MainTranslator]: Completed translation [2024-05-03 05:27:35,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35 WrapperNode [2024-05-03 05:27:35,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 05:27:35,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 05:27:35,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 05:27:35,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 05:27:35,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,850 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 133 [2024-05-03 05:27:35,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 05:27:35,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 05:27:35,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 05:27:35,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 05:27:35,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 05:27:35,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 05:27:35,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 05:27:35,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 05:27:35,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (1/1) ... [2024-05-03 05:27:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:27:35,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:35,930 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 05:27:35,933 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 05:27:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 05:27:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 05:27:35,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 05:27:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 05:27:35,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 05:27:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 05:27:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 05:27:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 05:27:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-03 05:27:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-03 05:27:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 05:27:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 05:27:35,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 05:27:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 05:27:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 05:27:35,965 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 05:27:36,099 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 05:27:36,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 05:27:36,311 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 05:27:36,357 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 05:27:36,358 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-03 05:27:36,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:27:36 BoogieIcfgContainer [2024-05-03 05:27:36,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 05:27:36,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 05:27:36,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 05:27:36,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 05:27:36,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 05:27:35" (1/3) ... [2024-05-03 05:27:36,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1239fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:27:36, skipping insertion in model container [2024-05-03 05:27:36,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:27:35" (2/3) ... [2024-05-03 05:27:36,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1239fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:27:36, skipping insertion in model container [2024-05-03 05:27:36,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:27:36" (3/3) ... [2024-05-03 05:27:36,364 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2024-05-03 05:27:36,371 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 05:27:36,401 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 05:27:36,401 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 05:27:36,401 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 05:27:36,436 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 05:27:36,471 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:27:36,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:27:36,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:36,474 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 05:27:36,481 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 05:27:36,539 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:27:36,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 05:27:36,551 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;@34e28c76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:27:36,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:27:36,558 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:36,618 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 140 states. [2024-05-03 05:27:36,619 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:36,621 INFO L78 Accepts]: Start accepts. Automaton has currently 141 states, but on-demand construction may add more states Word has length 91 [2024-05-03 05:27:36,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:36,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:36,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1388801947, now seen corresponding path program 1 times [2024-05-03 05:27:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:36,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415439932] [2024-05-03 05:27:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:36,929 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 05:27:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415439932] [2024-05-03 05:27:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415439932] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:27:36,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:27:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 05:27:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161977731] [2024-05-03 05:27:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:27:36,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 05:27:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:36,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 05:27:36,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 05:27:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:36,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:36,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 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 05:27:36,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:36,978 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:37,018 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 146 states. [2024-05-03 05:27:37,018 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,019 INFO L78 Accepts]: Start accepts. Automaton has currently 147 states, but on-demand construction may add more states Word has length 88 [2024-05-03 05:27:37,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:37,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 05:27:37,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:37,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1740650221, now seen corresponding path program 1 times [2024-05-03 05:27:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971350288] [2024-05-03 05:27:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:37,313 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 05:27:37,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:37,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971350288] [2024-05-03 05:27:37,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971350288] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:27:37,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:27:37,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-03 05:27:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018982406] [2024-05-03 05:27:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:27:37,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-03 05:27:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-03 05:27:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-03 05:27:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:37,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 05:27:37,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,330 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:37,410 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 161 states. [2024-05-03 05:27:37,410 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:37,410 INFO L78 Accepts]: Start accepts. Automaton has currently 162 states, but on-demand construction may add more states Word has length 92 [2024-05-03 05:27:37,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:37,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 05:27:37,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:37,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1644723608, now seen corresponding path program 1 times [2024-05-03 05:27:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:37,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283428845] [2024-05-03 05:27:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283428845] [2024-05-03 05:27:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283428845] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:27:37,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:27:37,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-03 05:27:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050938045] [2024-05-03 05:27:37,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:27:37,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-03 05:27:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-03 05:27:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-03 05:27:37,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,524 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:37,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 05:27:37,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:37,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,525 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:37,625 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 241 states. [2024-05-03 05:27:37,625 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:37,626 INFO L78 Accepts]: Start accepts. Automaton has currently 242 states, but on-demand construction may add more states Word has length 96 [2024-05-03 05:27:37,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:37,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 05:27:37,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:37,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1302511965, now seen corresponding path program 1 times [2024-05-03 05:27:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:37,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804400308] [2024-05-03 05:27:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 05:27:37,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804400308] [2024-05-03 05:27:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804400308] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:27:37,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:27:37,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 05:27:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710032027] [2024-05-03 05:27:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:27:37,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 05:27:37,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 05:27:37,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-03 05:27:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,833 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:37,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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 05:27:37,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:37,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:37,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,834 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:37,966 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 249 states. [2024-05-03 05:27:37,966 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:37,967 INFO L78 Accepts]: Start accepts. Automaton has currently 250 states, but on-demand construction may add more states Word has length 104 [2024-05-03 05:27:37,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:37,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-03 05:27:37,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:37,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash -391841281, now seen corresponding path program 1 times [2024-05-03 05:27:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781716107] [2024-05-03 05:27:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781716107] [2024-05-03 05:27:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781716107] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786735327] [2024-05-03 05:27:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:38,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:38,678 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 05:27:38,705 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 05:27:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:38,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2024-05-03 05:27:38,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:39,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:27:39,377 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:27:39,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-03 05:27:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:40,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786735327] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:27:40,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:27:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 30 [2024-05-03 05:27:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253230171] [2024-05-03 05:27:40,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:27:40,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-03 05:27:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:40,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-03 05:27:40,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-05-03 05:27:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:40,049 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:40,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.3) internal successors, (219), 30 states have internal predecessors, (219), 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 05:27:40,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:40,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:40,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:40,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:40,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:40,051 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:41,036 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 273 states. [2024-05-03 05:27:41,036 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:41,037 INFO L78 Accepts]: Start accepts. Automaton has currently 274 states, but on-demand construction may add more states Word has length 116 [2024-05-03 05:27:41,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:41,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 05:27:41,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:41,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:41,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1772858918, now seen corresponding path program 2 times [2024-05-03 05:27:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655467476] [2024-05-03 05:27:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 05:27:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655467476] [2024-05-03 05:27:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655467476] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579768480] [2024-05-03 05:27:41,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:27:41,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:41,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:41,313 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 05:27:41,328 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 05:27:41,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:27:41,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:27:41,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-03 05:27:41,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 05:27:41,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:27:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 05:27:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579768480] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:27:41,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:27:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2024-05-03 05:27:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672202168] [2024-05-03 05:27:41,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:27:41,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 05:27:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 05:27:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-03 05:27:41,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:41,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:41,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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 05:27:41,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:41,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:41,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:41,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:41,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:41,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:41,671 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:41,786 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 414 states. [2024-05-03 05:27:41,787 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:41,788 INFO L78 Accepts]: Start accepts. Automaton has currently 415 states, but on-demand construction may add more states Word has length 120 [2024-05-03 05:27:41,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:41,796 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 05:27:41,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:41,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:41,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1002693909, now seen corresponding path program 3 times [2024-05-03 05:27:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:41,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046007376] [2024-05-03 05:27:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:41,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046007376] [2024-05-03 05:27:42,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046007376] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912032720] [2024-05-03 05:27:42,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:27:42,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:42,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:42,885 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 05:27:42,924 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 05:27:43,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-03 05:27:43,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:27:43,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-03 05:27:43,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-03 05:27:43,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:27:43,831 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:27:43,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-03 05:27:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-03 05:27:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912032720] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:27:44,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:27:44,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 15] total 41 [2024-05-03 05:27:44,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33124242] [2024-05-03 05:27:44,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:27:44,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-03 05:27:44,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:44,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-03 05:27:44,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2024-05-03 05:27:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:44,147 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:44,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.170731707317073) internal successors, (253), 41 states have internal predecessors, (253), 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 05:27:44,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:44,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:44,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:44,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:44,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:44,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:44,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:44,148 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:45,532 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 423 states. [2024-05-03 05:27:45,532 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:45,533 INFO L78 Accepts]: Start accepts. Automaton has currently 424 states, but on-demand construction may add more states Word has length 128 [2024-05-03 05:27:45,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:45,539 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 05:27:45,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:45,749 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:45,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash 816254349, now seen corresponding path program 4 times [2024-05-03 05:27:45,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:45,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043645613] [2024-05-03 05:27:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:46,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043645613] [2024-05-03 05:27:46,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043645613] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424019002] [2024-05-03 05:27:46,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 05:27:46,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:46,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:46,852 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 05:27:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-03 05:27:46,931 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 05:27:46,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:27:46,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 37 conjunts are in the unsatisfiable core [2024-05-03 05:27:46,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:47,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:27:47,647 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-03 05:27:47,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-03 05:27:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424019002] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:27:48,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:27:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 49 [2024-05-03 05:27:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184210807] [2024-05-03 05:27:48,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:27:48,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-05-03 05:27:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-05-03 05:27:48,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=1902, Unknown=0, NotChecked=0, Total=2352 [2024-05-03 05:27:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:48,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.938775510204081) internal successors, (291), 49 states have internal predecessors, (291), 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 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:48,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:48,665 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:50,135 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 447 states. [2024-05-03 05:27:50,135 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:27:50,136 INFO L78 Accepts]: Start accepts. Automaton has currently 448 states, but on-demand construction may add more states Word has length 140 [2024-05-03 05:27:50,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:50,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-03 05:27:50,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-03 05:27:50,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:50,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash 475989172, now seen corresponding path program 5 times [2024-05-03 05:27:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891124275] [2024-05-03 05:27:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:27:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891124275] [2024-05-03 05:27:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891124275] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652725741] [2024-05-03 05:27:50,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 05:27:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:50,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:27:50,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-03 05:27:50,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-05-03 05:27:50,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:27:50,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-03 05:27:50,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:27:50,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:27:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:27:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652725741] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:27:50,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:27:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 10 [2024-05-03 05:27:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267953823] [2024-05-03 05:27:50,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:27:50,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-03 05:27:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-03 05:27:50,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-05-03 05:27:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:50,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:50,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 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 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:27:50,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:50,930 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:51,042 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 651 states. [2024-05-03 05:27:51,042 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:27:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:27:51,043 INFO L78 Accepts]: Start accepts. Automaton has currently 652 states, but on-demand construction may add more states Word has length 144 [2024-05-03 05:27:51,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:51,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-03 05:27:51,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:51,249 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:51,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1372756601, now seen corresponding path program 6 times [2024-05-03 05:27:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410807233] [2024-05-03 05:27:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410807233] [2024-05-03 05:27:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410807233] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379657073] [2024-05-03 05:27:52,467 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-03 05:27:52,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:52,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:52,486 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:27:52,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-03 05:27:52,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-05-03 05:27:52,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:27:52,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2024-05-03 05:27:52,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 05:27:53,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:27:53,178 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-03 05:27:53,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-03 05:27:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:27:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379657073] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:27:53,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:27:53,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 11] total 40 [2024-05-03 05:27:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403522204] [2024-05-03 05:27:53,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:27:53,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-05-03 05:27:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-05-03 05:27:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1434, Unknown=0, NotChecked=0, Total=1560 [2024-05-03 05:27:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:53,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:53,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.275) internal successors, (251), 40 states have internal predecessors, (251), 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 05:27:53,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:27:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:53,271 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:54,993 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 675 states. [2024-05-03 05:27:54,993 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:27:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:27:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:27:54,994 INFO L78 Accepts]: Start accepts. Automaton has currently 676 states, but on-demand construction may add more states Word has length 156 [2024-05-03 05:27:54,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:55,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-03 05:27:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-03 05:27:55,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:55,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1029879712, now seen corresponding path program 7 times [2024-05-03 05:27:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:55,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707747827] [2024-05-03 05:27:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-03 05:27:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707747827] [2024-05-03 05:27:55,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707747827] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:55,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501513689] [2024-05-03 05:27:55,332 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-03 05:27:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:55,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:27:55,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-03 05:27:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:55,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-03 05:27:55,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-03 05:27:55,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:27:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-03 05:27:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501513689] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:27:55,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:27:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 13 [2024-05-03 05:27:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021168435] [2024-05-03 05:27:55,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:27:55,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-03 05:27:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:27:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-03 05:27:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-05-03 05:27:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:55,816 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:27:55,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.153846153846153) internal successors, (210), 13 states have internal predecessors, (210), 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 05:27:55,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:55,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:55,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:55,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:55,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:27:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:27:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:27:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:55,817 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:27:55,969 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 942 states. [2024-05-03 05:27:55,969 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:27:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:27:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:27:55,971 INFO L78 Accepts]: Start accepts. Automaton has currently 943 states, but on-demand construction may add more states Word has length 160 [2024-05-03 05:27:55,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:27:55,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-03 05:27:56,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:56,177 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:27:56,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:27:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1606948709, now seen corresponding path program 8 times [2024-05-03 05:27:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:27:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983586831] [2024-05-03 05:27:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:27:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:27:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:27:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:57,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:27:57,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983586831] [2024-05-03 05:27:57,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983586831] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:27:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630309221] [2024-05-03 05:27:57,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:27:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:27:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:27:57,586 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:27:57,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-03 05:27:57,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:27:57,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:27:57,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 66 conjunts are in the unsatisfiable core [2024-05-03 05:27:57,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:27:58,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-05-03 05:27:58,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 05:27:59,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 05:27:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:27:59,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:00,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:28:00,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2024-05-03 05:28:00,746 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:28:00,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 133 [2024-05-03 05:28:00,757 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-03 05:28:00,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 102 [2024-05-03 05:28:00,765 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-03 05:28:00,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 67 [2024-05-03 05:28:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630309221] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:01,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 33] total 91 [2024-05-03 05:28:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803412259] [2024-05-03 05:28:01,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:01,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2024-05-03 05:28:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2024-05-03 05:28:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=6949, Unknown=49, NotChecked=0, Total=8190 [2024-05-03 05:28:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:01,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:01,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 4.56043956043956) internal successors, (415), 91 states have internal predecessors, (415), 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 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:01,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:01,676 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:06,576 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 966 states. [2024-05-03 05:28:06,576 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:06,577 INFO L78 Accepts]: Start accepts. Automaton has currently 967 states, but on-demand construction may add more states Word has length 172 [2024-05-03 05:28:06,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:06,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-05-03 05:28:06,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:06,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:06,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1010850444, now seen corresponding path program 9 times [2024-05-03 05:28:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231460243] [2024-05-03 05:28:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-05-03 05:28:06,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:06,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231460243] [2024-05-03 05:28:06,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231460243] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:06,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681491512] [2024-05-03 05:28:06,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:28:06,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:06,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:06,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:06,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-03 05:28:07,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-03 05:28:07,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:28:07,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-03 05:28:07,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-05-03 05:28:07,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 34 proven. 48 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-05-03 05:28:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681491512] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:08,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 11] total 16 [2024-05-03 05:28:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124609107] [2024-05-03 05:28:08,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-03 05:28:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:08,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-03 05:28:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-05-03 05:28:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:08,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:08,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.125) internal successors, (226), 16 states have internal predecessors, (226), 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 05:28:08,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:08,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:08,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:08,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:08,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:08,274 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:08,522 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1296 states. [2024-05-03 05:28:08,522 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:08,524 INFO L78 Accepts]: Start accepts. Automaton has currently 1297 states, but on-demand construction may add more states Word has length 176 [2024-05-03 05:28:08,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:08,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-03 05:28:08,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-03 05:28:08,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:08,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash -644905903, now seen corresponding path program 10 times [2024-05-03 05:28:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041555092] [2024-05-03 05:28:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041555092] [2024-05-03 05:28:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041555092] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465536012] [2024-05-03 05:28:10,372 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 05:28:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:10,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:10,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-03 05:28:10,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 05:28:10,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:28:10,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 59 conjunts are in the unsatisfiable core [2024-05-03 05:28:10,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:11,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:11,969 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-03 05:28:11,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-03 05:28:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465536012] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:13,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:13,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31, 31] total 85 [2024-05-03 05:28:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965056679] [2024-05-03 05:28:13,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:13,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-05-03 05:28:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-05-03 05:28:13,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=826, Invalid=6314, Unknown=0, NotChecked=0, Total=7140 [2024-05-03 05:28:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:13,586 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:13,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 5.117647058823529) internal successors, (435), 85 states have internal predecessors, (435), 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 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:13,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:13,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:13,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:13,589 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:18,346 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1320 states. [2024-05-03 05:28:18,347 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:18,348 INFO L78 Accepts]: Start accepts. Automaton has currently 1321 states, but on-demand construction may add more states Word has length 188 [2024-05-03 05:28:18,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:18,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-05-03 05:28:18,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:18,554 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:18,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1006637704, now seen corresponding path program 11 times [2024-05-03 05:28:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080763381] [2024-05-03 05:28:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 72 proven. 50 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-03 05:28:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080763381] [2024-05-03 05:28:18,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080763381] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332720470] [2024-05-03 05:28:18,700 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 05:28:18,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:18,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:18,726 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:18,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-03 05:28:18,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-05-03 05:28:18,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:28:18,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-03 05:28:18,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 72 proven. 50 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-03 05:28:19,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-03 05:28:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332720470] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:19,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:19,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 13] total 19 [2024-05-03 05:28:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427220942] [2024-05-03 05:28:19,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:19,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-03 05:28:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-03 05:28:19,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2024-05-03 05:28:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:19,491 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:19,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.736842105263158) internal successors, (242), 19 states have internal predecessors, (242), 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 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:19,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:19,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:19,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:19,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:19,492 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:19,905 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1713 states. [2024-05-03 05:28:19,905 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:19,906 INFO L78 Accepts]: Start accepts. Automaton has currently 1714 states, but on-demand construction may add more states Word has length 192 [2024-05-03 05:28:19,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:19,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-03 05:28:20,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-03 05:28:20,112 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:20,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -298786499, now seen corresponding path program 12 times [2024-05-03 05:28:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:20,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499294686] [2024-05-03 05:28:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499294686] [2024-05-03 05:28:22,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499294686] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713047829] [2024-05-03 05:28:22,046 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-03 05:28:22,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:22,048 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:22,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-03 05:28:22,754 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-03 05:28:22,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:28:22,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 60 conjunts are in the unsatisfiable core [2024-05-03 05:28:22,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 317 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 05:28:23,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:23,728 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-03 05:28:23,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-03 05:28:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-03 05:28:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713047829] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:23,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 30, 17] total 64 [2024-05-03 05:28:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36008892] [2024-05-03 05:28:23,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:23,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-03 05:28:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-03 05:28:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3816, Unknown=0, NotChecked=0, Total=4032 [2024-05-03 05:28:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:23,834 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:23,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.421875) internal successors, (347), 64 states have internal predecessors, (347), 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 05:28:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:23,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:23,835 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:28,070 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1737 states. [2024-05-03 05:28:28,070 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:28,071 INFO L78 Accepts]: Start accepts. Automaton has currently 1738 states, but on-demand construction may add more states Word has length 204 [2024-05-03 05:28:28,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:28,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-05-03 05:28:28,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-03 05:28:28,273 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:28,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash 799633508, now seen corresponding path program 13 times [2024-05-03 05:28:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181151899] [2024-05-03 05:28:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 98 proven. 72 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-05-03 05:28:28,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181151899] [2024-05-03 05:28:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181151899] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411852952] [2024-05-03 05:28:28,497 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-03 05:28:28,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:28,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:28,498 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:28,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-03 05:28:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:28,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-03 05:28:28,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 98 proven. 72 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-05-03 05:28:28,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 74 proven. 96 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-05-03 05:28:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411852952] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:29,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 15] total 22 [2024-05-03 05:28:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420467644] [2024-05-03 05:28:29,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:29,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-03 05:28:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-03 05:28:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-05-03 05:28:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:29,276 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:29,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.727272727272727) internal successors, (258), 22 states have internal predecessors, (258), 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 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:29,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:29,277 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:29,601 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2193 states. [2024-05-03 05:28:29,602 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:28:29,603 INFO L78 Accepts]: Start accepts. Automaton has currently 2194 states, but on-demand construction may add more states Word has length 208 [2024-05-03 05:28:29,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:29,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-05-03 05:28:29,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-05-03 05:28:29,810 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:29,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2092183081, now seen corresponding path program 14 times [2024-05-03 05:28:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:29,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671482158] [2024-05-03 05:28:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:29,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671482158] [2024-05-03 05:28:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671482158] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758147704] [2024-05-03 05:28:31,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:28:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:31,911 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:31,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-03 05:28:32,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:28:32,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:28:32,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 75 conjunts are in the unsatisfiable core [2024-05-03 05:28:32,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:33,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:34,000 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-03 05:28:34,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-03 05:28:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758147704] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:36,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39, 39] total 109 [2024-05-03 05:28:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350143173] [2024-05-03 05:28:36,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2024-05-03 05:28:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2024-05-03 05:28:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1217, Invalid=10555, Unknown=0, NotChecked=0, Total=11772 [2024-05-03 05:28:36,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:36,422 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:36,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 4.871559633027523) internal successors, (531), 109 states have internal predecessors, (531), 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 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:36,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:28:36,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:36,424 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:43,763 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2217 states. [2024-05-03 05:28:43,763 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:28:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:28:43,764 INFO L78 Accepts]: Start accepts. Automaton has currently 2218 states, but on-demand construction may add more states Word has length 220 [2024-05-03 05:28:43,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-03 05:28:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-03 05:28:43,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:43,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1975196848, now seen corresponding path program 15 times [2024-05-03 05:28:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460473336] [2024-05-03 05:28:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 128 proven. 98 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-03 05:28:44,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460473336] [2024-05-03 05:28:44,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460473336] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174656072] [2024-05-03 05:28:44,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:28:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:44,220 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:44,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-03 05:28:44,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-05-03 05:28:44,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:28:44,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-03 05:28:44,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 128 proven. 98 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-03 05:28:44,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 126 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-03 05:28:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174656072] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:45,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 17] total 25 [2024-05-03 05:28:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474930142] [2024-05-03 05:28:45,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:45,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-03 05:28:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-03 05:28:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2024-05-03 05:28:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:45,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:45,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.96) internal successors, (274), 25 states have internal predecessors, (274), 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 05:28:45,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:45,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:45,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:45,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:45,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:28:45,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:45,203 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:28:45,774 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2736 states. [2024-05-03 05:28:45,774 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:28:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-03 05:28:45,775 INFO L78 Accepts]: Start accepts. Automaton has currently 2737 states, but on-demand construction may add more states Word has length 224 [2024-05-03 05:28:45,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:28:45,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-05-03 05:28:45,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:45,980 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:28:45,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:28:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash 337734421, now seen corresponding path program 16 times [2024-05-03 05:28:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:28:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638923168] [2024-05-03 05:28:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:28:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:28:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:28:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:28:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638923168] [2024-05-03 05:28:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638923168] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:28:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517666741] [2024-05-03 05:28:47,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 05:28:47,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:28:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:28:47,963 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:28:47,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-05-03 05:28:48,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 05:28:48,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:28:48,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 83 conjunts are in the unsatisfiable core [2024-05-03 05:28:48,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:28:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:49,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:28:50,321 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-03 05:28:50,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-03 05:28:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:28:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517666741] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:28:52,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:28:52,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 43, 43] total 121 [2024-05-03 05:28:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312341559] [2024-05-03 05:28:52,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:28:52,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2024-05-03 05:28:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:28:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2024-05-03 05:28:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1737, Invalid=12783, Unknown=0, NotChecked=0, Total=14520 [2024-05-03 05:28:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:52,959 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:28:52,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 4.785123966942149) internal successors, (579), 121 states have internal predecessors, (579), 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 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-03 05:28:52,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:28:52,961 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:29:01,670 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2760 states. [2024-05-03 05:29:01,670 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:29:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-03 05:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-05-03 05:29:01,671 INFO L78 Accepts]: Start accepts. Automaton has currently 2761 states, but on-demand construction may add more states Word has length 236 [2024-05-03 05:29:01,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:29:01,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-05-03 05:29:01,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:29:01,878 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:29:01,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:29:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1898297796, now seen corresponding path program 17 times [2024-05-03 05:29:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:29:01,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829827825] [2024-05-03 05:29:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:29:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:29:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:29:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 162 proven. 128 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-03 05:29:02,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:29:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829827825] [2024-05-03 05:29:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829827825] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:29:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820194384] [2024-05-03 05:29:02,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 05:29:02,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:29:02,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:29:02,304 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:29:02,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-05-03 05:29:02,506 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-05-03 05:29:02,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:29:02,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-03 05:29:02,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:29:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 162 proven. 128 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-03 05:29:02,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:29:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 130 proven. 160 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-03 05:29:03,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820194384] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:29:03,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:29:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 19] total 28 [2024-05-03 05:29:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256785949] [2024-05-03 05:29:03,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:29:03,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-03 05:29:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:29:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-03 05:29:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=486, Unknown=0, NotChecked=0, Total=756 [2024-05-03 05:29:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:03,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:29:03,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.357142857142858) internal successors, (290), 28 states have internal predecessors, (290), 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 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-05-03 05:29:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:03,052 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:29:03,792 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3342 states. [2024-05-03 05:29:03,793 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:29:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-03 05:29:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-05-03 05:29:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-03 05:29:03,794 INFO L78 Accepts]: Start accepts. Automaton has currently 3343 states, but on-demand construction may add more states Word has length 240 [2024-05-03 05:29:03,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:29:03,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-05-03 05:29:04,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-05-03 05:29:04,002 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:29:04,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:29:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash -209676287, now seen corresponding path program 18 times [2024-05-03 05:29:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:29:04,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898924070] [2024-05-03 05:29:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:29:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:29:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:29:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:29:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:29:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898924070] [2024-05-03 05:29:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898924070] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:29:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449187402] [2024-05-03 05:29:07,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-03 05:29:07,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:29:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:29:07,025 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:29:07,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-05-03 05:29:08,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-05-03 05:29:08,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:29:08,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 27 conjunts are in the unsatisfiable core [2024-05-03 05:29:08,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:29:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 144 proven. 180 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-03 05:29:09,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:29:10,289 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:29:10,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-03 05:29:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 112 proven. 212 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-03 05:29:11,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449187402] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:29:11,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:29:11,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 23, 23] total 88 [2024-05-03 05:29:11,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901451288] [2024-05-03 05:29:11,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:29:11,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-05-03 05:29:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:29:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-05-03 05:29:11,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=6703, Unknown=0, NotChecked=0, Total=7656 [2024-05-03 05:29:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:11,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:29:11,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 5.681818181818182) internal successors, (500), 88 states have internal predecessors, (500), 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 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-03 05:29:11,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:29:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-03 05:29:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-03 05:29:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-05-03 05:29:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-03 05:29:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:29:11,052 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:29:17,243 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,243 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:17,243 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,247 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,247 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,247 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,270 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,270 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,270 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,289 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,289 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,289 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,322 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,323 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,323 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,342 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,342 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,342 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,367 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,367 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,367 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,382 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:17,382 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:17,382 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,764 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,764 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,764 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,771 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,772 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,772 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,778 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,778 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,778 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,779 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,779 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,779 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,787 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,787 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,787 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,791 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,791 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,791 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,791 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,791 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,791 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,797 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,797 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,797 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,805 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,805 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,805 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,825 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,825 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,825 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,836 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,836 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,837 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,857 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,857 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,858 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,869 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,869 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,869 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,890 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,890 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,890 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,902 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,902 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,902 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,924 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,925 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,925 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,950 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,950 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,950 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,973 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,973 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:18,973 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,985 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:18,985 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:18,985 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,008 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:19,008 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:19,008 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,020 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:19,020 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,020 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,046 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:19,046 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:19,046 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,060 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:19,060 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,060 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,277 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:19,277 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:29:19,277 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,285 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:19,285 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:19,285 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,194 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,194 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,195 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,195 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,195 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,196 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,196 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,196 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,196 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,196 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,196 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,197 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,197 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,197 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,198 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,198 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,198 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,198 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,198 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,199 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,199 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,199 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,199 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,200 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:20,200 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:20,200 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,850 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,851 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,851 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,852 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,852 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,852 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,853 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,853 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,853 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,854 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,854 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,854 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,855 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,855 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,855 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,856 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,856 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,856 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,857 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,857 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,857 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,858 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:22,858 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:22,858 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,600 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,600 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,600 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,625 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,626 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,626 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,651 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,652 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,652 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,678 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,678 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,678 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,704 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,705 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,705 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,731 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,732 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,732 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,758 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,758 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,758 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,787 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:25,787 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:25,787 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,757 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:31,758 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,758 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,805 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:31,805 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,805 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,854 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:31,854 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,854 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,902 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:31,902 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,902 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,952 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:31,952 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:31,952 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:32,004 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:32,004 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:32,004 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:32,055 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:32,055 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:32,055 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:42,981 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:42,981 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:42,981 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,073 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:43,073 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,073 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,171 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:43,171 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,171 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,263 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:43,263 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,264 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,360 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:43,361 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,361 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,454 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:43,454 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:43,454 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:49,683 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:49,684 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:49,684 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:49,802 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:49,802 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:49,803 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:49,907 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:49,908 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:49,908 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:50,028 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:50,028 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:50,028 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:50,155 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:29:50,155 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:29:50,155 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,225 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:02,225 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,225 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,387 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:02,387 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,387 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,566 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:02,567 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,567 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,751 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:02,752 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:02,752 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:09,573 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:09,573 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:09,573 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:09,659 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:09,659 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:09,659 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:09,758 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:09,758 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:09,758 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:13,388 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:13,388 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:13,388 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:13,504 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:13,504 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:13,504 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:14,690 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:14,690 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:14,690 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,292 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:18,292 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,292 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,304 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:18,304 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,304 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,315 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:18,315 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,316 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,327 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:18,327 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,327 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,341 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:18,341 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,341 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,355 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:18,355 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,355 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,371 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:18,371 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:18,371 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:34,779 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:34,779 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:34,779 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:34,966 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:34,966 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:34,966 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,134 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:35,134 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,134 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,319 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:35,320 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,320 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,479 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:35,479 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,479 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,612 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:35,612 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,612 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,743 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:30:35,743 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:30:35,743 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:19,873 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:19,873 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:19,874 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:20,223 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:20,223 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:20,223 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:20,497 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:20,498 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:20,498 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:20,746 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:20,746 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:20,746 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:21,063 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:21,064 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:21,064 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:21,390 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:21,390 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:21,390 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:57,252 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:57,253 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:57,253 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:57,611 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:57,612 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:57,612 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:57,963 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:57,964 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:57,964 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:58,322 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:58,323 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:58,323 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:58,706 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:31:58,707 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:31:58,707 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:27,158 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:27,158 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:27,158 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:27,582 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:27,583 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:27,583 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:28,003 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:28,004 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:28,004 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:28,419 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:28,419 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:28,419 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:47,545 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:47,545 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:47,545 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:47,899 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:47,899 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:47,899 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:48,252 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:48,252 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:48,252 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:57,341 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:57,342 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:57,342 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:57,701 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:32:57,701 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:32:57,701 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:01,508 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:33:01,508 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:01,508 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:30,909 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:33:30,909 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:30,909 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:31,386 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:33:31,386 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:31,386 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:31,872 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:33:31,872 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:31,872 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:32,350 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:33:32,350 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:32,350 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:32,759 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:33:32,759 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:32,759 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:33,170 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:33:33,170 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:33:33,171 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:13,219 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:13,219 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:13,219 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:13,633 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:13,633 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:13,633 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:14,036 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:14,036 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:14,036 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:14,463 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:14,463 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:14,463 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:14,904 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:14,905 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:14,905 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:49,010 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:49,011 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:49,011 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:49,409 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:49,409 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:49,409 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:49,829 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:49,829 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:49,829 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:50,261 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:34:50,262 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:34:50,262 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:11,240 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:11,240 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:11,240 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:11,674 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:11,674 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:11,674 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:12,117 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:12,117 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:12,117 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:23,788 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:23,788 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:23,789 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:24,242 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:24,243 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:24,243 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:28,991 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:28,991 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:28,991 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:52,985 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:52,986 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:52,986 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:53,376 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:53,376 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:53,377 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:53,767 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:53,767 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:53,767 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:54,156 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:54,157 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:54,157 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:54,551 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:54,551 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:35:54,552 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:30,864 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:36:30,864 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:30,864 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:31,414 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:36:31,414 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:31,415 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:31,951 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:36:31,951 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:31,951 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:32,505 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:36:32,505 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:32,506 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:56,819 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:36:56,820 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:56,820 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:57,371 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:36:57,372 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:57,372 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:57,931 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:36:57,931 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:36:57,931 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:11,831 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:11,831 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:11,831 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:12,375 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:12,375 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:12,375 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:17,748 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:17,749 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:17,749 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:39,247 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:39,248 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:39,248 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:39,733 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:39,733 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:39,733 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:40,221 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,221 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:40,221 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:40,720 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,721 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:37:40,721 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:04,001 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:04,001 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:04,002 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:04,488 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:04,488 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:04,488 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:04,976 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:04,977 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:04,977 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:17,965 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:17,965 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:17,965 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:18,471 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:18,471 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:18,472 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:23,830 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:23,830 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:23,830 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:39,992 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:39,992 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:39,992 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:40,493 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:40,494 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:40,494 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:40,991 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:40,991 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:40,991 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:53,696 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:53,696 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:53,696 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:54,198 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:54,198 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:54,199 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:59,322 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:38:59,323 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:38:59,323 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:08,291 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:08,291 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:08,291 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:08,810 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:08,811 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:08,811 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:14,131 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:14,131 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:14,131 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:18,446 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:18,447 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:18,447 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,607 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:25,608 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,608 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,641 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:25,642 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,642 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,676 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:25,676 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,676 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,710 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:25,710 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,710 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,745 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:25,745 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,745 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,779 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:25,780 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:39:25,780 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:08,887 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:08,888 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:08,888 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:09,409 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:09,409 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:09,409 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:09,936 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:09,936 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:09,936 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:10,463 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:10,463 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:10,463 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:10,998 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:10,998 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:10,998 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:11,530 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:11,530 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:11,530 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:11,159 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:11,160 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:11,160 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:11,727 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:11,728 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:11,728 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:12,287 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:12,287 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:12,287 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:12,848 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:12,848 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:12,848 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:13,417 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:13,418 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:13,418 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] Received shutdown request... [2024-05-03 05:41:47,614 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 163231 states. [2024-05-03 05:41:47,614 INFO L212 cStratifiedReduction]: Copied states 573 times. [2024-05-03 05:41:47,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-05-03 05:41:47,624 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 05:41:47,624 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 05:41:47,625 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 05:41:47,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:41:47,822 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. [2024-05-03 05:41:47,824 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 05:41:47,937 INFO L445 BasicCegarLoop]: Path program histogram: [18, 1, 1, 1, 1] [2024-05-03 05:41:47,938 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-03 05:41:47,941 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 05:41:47,942 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 05:41:47,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 05:41:47 BasicIcfg [2024-05-03 05:41:47,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 05:41:47,947 INFO L158 Benchmark]: Toolchain (without parser) took 852306.60ms. Allocated memory was 278.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 205.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2024-05-03 05:41:47,949 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 278.9MB. Free memory is still 247.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 05:41:47,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.48ms. Allocated memory is still 278.9MB. Free memory was 205.4MB in the beginning and 193.7MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-03 05:41:47,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.35ms. Allocated memory is still 278.9MB. Free memory was 193.7MB in the beginning and 191.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 05:41:47,950 INFO L158 Benchmark]: Boogie Preprocessor took 42.81ms. Allocated memory is still 278.9MB. Free memory was 191.8MB in the beginning and 190.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 05:41:47,950 INFO L158 Benchmark]: RCFGBuilder took 464.25ms. Allocated memory is still 278.9MB. Free memory was 190.0MB in the beginning and 168.8MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-03 05:41:47,950 INFO L158 Benchmark]: TraceAbstraction took 851585.42ms. Allocated memory was 278.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 167.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2024-05-03 05:41:47,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 278.9MB. Free memory is still 247.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.48ms. Allocated memory is still 278.9MB. Free memory was 205.4MB in the beginning and 193.7MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.35ms. Allocated memory is still 278.9MB. Free memory was 193.7MB in the beginning and 191.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.81ms. Allocated memory is still 278.9MB. Free memory was 191.8MB in the beginning and 190.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 464.25ms. Allocated memory is still 278.9MB. Free memory was 190.0MB in the beginning and 168.8MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 851585.42ms. Allocated memory was 278.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 167.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 188563, independent: 165665, independent conditional: 165665, independent unconditional: 0, dependent: 22898, dependent conditional: 22898, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166455, independent: 165665, independent conditional: 165665, independent unconditional: 0, dependent: 790, dependent conditional: 790, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 166455, independent: 165665, independent conditional: 165665, independent unconditional: 0, dependent: 790, dependent conditional: 790, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183835, independent: 165665, independent conditional: 0, independent unconditional: 165665, dependent: 18170, dependent conditional: 17380, dependent unconditional: 790, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183835, independent: 165665, independent conditional: 0, independent unconditional: 165665, dependent: 18170, dependent conditional: 0, dependent unconditional: 18170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183835, independent: 165665, independent conditional: 0, independent unconditional: 165665, dependent: 18170, dependent conditional: 0, dependent unconditional: 18170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 166455, independent: 165665, independent conditional: 0, independent unconditional: 165665, dependent: 790, dependent conditional: 0, dependent unconditional: 790, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 166455, independent: 165665, independent conditional: 0, independent unconditional: 165665, dependent: 790, dependent conditional: 0, dependent unconditional: 790, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 790, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 790, dependent conditional: 0, dependent unconditional: 790, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 790, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 790, dependent conditional: 0, dependent unconditional: 790, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 790, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 790, dependent conditional: 0, dependent unconditional: 790, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1129, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1129, dependent conditional: 0, dependent unconditional: 1129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 183835, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17380, dependent conditional: 0, dependent unconditional: 17380, unknown: 166455, unknown conditional: 0, unknown unconditional: 166455] , Statistics on independence cache: Total cache size (in pairs): 166455, Positive cache size: 165665, Positive conditional cache size: 0, Positive unconditional cache size: 165665, Negative cache size: 790, Negative conditional cache size: 0, Negative unconditional cache size: 790, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17380, Maximal queried relation: 22, Independence queries for same thread: 22108 - StatisticsResult: Reduction benchmarks 23.0ms Time before loop, 37.2ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 140, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 17.7ms Time before loop, 22.5ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 146, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 39.4ms Time before loop, 40.2ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 161, Duplicate States: 0, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 7.4ms Time before loop, 91.9ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 241, Duplicate States: 0, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 65.0ms Time before loop, 67.1ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 249, Duplicate States: 0, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 595.0ms Time before loop, 389.9ms Time in loop, 1.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 273, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 15.2ms Time before loop, 99.8ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 414, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 1129.5ms Time before loop, 253.9ms Time in loop, 1.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 423, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 835.8ms Time before loop, 633.3ms Time in loop, 1.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 447, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 14.6ms Time before loop, 97.1ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 651, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 1003.2ms Time before loop, 718.3ms Time in loop, 1.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 675, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 15.4ms Time before loop, 136.8ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 942, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 2655.1ms Time before loop, 2244.2ms Time in loop, 4.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 966, Duplicate States: 0, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 15.5ms Time before loop, 232.6ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1296, Duplicate States: 0, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 1766.7ms Time before loop, 2991.0ms Time in loop, 4.8s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1320, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 19.5ms Time before loop, 393.3ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1713, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 2114.1ms Time before loop, 2120.6ms Time in loop, 4.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1737, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 18.9ms Time before loop, 305.0ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2193, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 2780.0ms Time before loop, 4558.9ms Time in loop, 7.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2217, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 14.3ms Time before loop, 556.2ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2736, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 3431.6ms Time before loop, 5277.9ms Time in loop, 8.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2760, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 16.8ms Time before loop, 723.9ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 3342, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 2620.5ms Time before loop, 753941.1ms Time in loop, 756.6s Time in total, Has Loop: 1, wrong guesses: 12, overall guesses: 195, Reduction States: 163231, Duplicate States: 573, Protected Variables: 17 - StatisticsResult: Visitor Statistics States: 99, Transitions: 99, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 99, Transitions: 102, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 113, Transitions: 118, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 179, Transitions: 200, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 186, Transitions: 207, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 208, Transitions: 231, Traversal time: 1.0s - StatisticsResult: Visitor Statistics States: 336, Transitions: 384, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 344, Transitions: 392, Traversal time: 1.4s - StatisticsResult: Visitor Statistics States: 366, Transitions: 416, Traversal time: 1.5s - StatisticsResult: Visitor Statistics States: 556, Transitions: 640, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 578, Transitions: 664, Traversal time: 1.7s - StatisticsResult: Visitor Statistics States: 830, Transitions: 959, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 852, Transitions: 983, Traversal time: 4.9s - StatisticsResult: Visitor Statistics States: 1166, Transitions: 1349, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 1188, Transitions: 1373, Traversal time: 4.8s - StatisticsResult: Visitor Statistics States: 1564, Transitions: 1810, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 1586, Transitions: 1834, Traversal time: 4.2s - StatisticsResult: Visitor Statistics States: 2024, Transitions: 2342, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 2046, Transitions: 2366, Traversal time: 7.3s - StatisticsResult: Visitor Statistics States: 2546, Transitions: 2945, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 2568, Transitions: 2969, Traversal time: 8.7s - StatisticsResult: Visitor Statistics States: 3130, Transitions: 3619, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 162016, Transitions: 196389, Traversal time: 756.6s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 157, RedundantProofs: 20, ProvenStates: 26997, Times there's more than one choice: 26286, Avg number of choices: 19.500870467088937 - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 132 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 851.4s, OverallIterations: 22, TraceHistogramMax: 0, PathProgramHistogramMax: 18, EmptinessCheckTime: 795.2s, 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: 920, 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.4s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 46.3s InterpolantComputationTime, 6623 NumberOfCodeBlocks, 6529 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 9693 ConstructedInterpolants, 145 QuantifiedInterpolants, 86470 SizeOfPredicates, 253 NumberOfNonLiveVariables, 6221 ConjunctsInSsa, 575 ConjunctsInUnsatCore, 58 InterpolantComputations, 4 PerfectInterpolantSequences, 6862/14568 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