/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-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:59:59,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:59:59,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:59:59,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:59:59,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:59:59,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:59:59,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:59:59,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:59:59,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:59:59,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:59:59,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:59:59,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:59:59,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:59:59,851 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:59:59,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:59:59,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:59:59,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:59:59,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:59:59,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:59:59,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:59:59,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:59:59,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:59:59,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:59:59,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:59:59,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:59:59,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:59:59,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:59:59,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:59:59,854 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:59:59,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:59:59,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:59:59,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:59:59,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:59:59,856 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:59:59,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 17:00:00,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 17:00:00,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 17:00:00,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 17:00:00,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 17:00:00,101 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 17:00:00,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-05-30 17:00:01,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 17:00:01,284 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 17:00:01,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-05-30 17:00:01,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/eb5f64f3b/a811090a7a244ce49848b2618e268abd/FLAG17b863e5c [2024-05-30 17:00:01,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/eb5f64f3b/a811090a7a244ce49848b2618e268abd [2024-05-30 17:00:01,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 17:00:01,308 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 17:00:01,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 17:00:01,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 17:00:01,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 17:00:01,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f864d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01, skipping insertion in model container [2024-05-30 17:00:01,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 17:00:01,456 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-two-queue.wvr.c[2987,3000] [2024-05-30 17:00:01,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:00:01,468 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 17:00:01,483 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-two-queue.wvr.c[2987,3000] [2024-05-30 17:00:01,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:00:01,495 INFO L206 MainTranslator]: Completed translation [2024-05-30 17:00:01,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01 WrapperNode [2024-05-30 17:00:01,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 17:00:01,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 17:00:01,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 17:00:01,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 17:00:01,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,531 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 208 [2024-05-30 17:00:01,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 17:00:01,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 17:00:01,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 17:00:01,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 17:00:01,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 17:00:01,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 17:00:01,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 17:00:01,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 17:00:01,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (1/1) ... [2024-05-30 17:00:01,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 17:00:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:01,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 17:00:01,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 17:00:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 17:00:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 17:00:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 17:00:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 17:00:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 17:00:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 17:00:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 17:00:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 17:00:01,639 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 17:00:01,711 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 17:00:01,713 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 17:00:01,999 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 17:00:02,091 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 17:00:02,092 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-30 17:00:02,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:00:02 BoogieIcfgContainer [2024-05-30 17:00:02,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 17:00:02,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 17:00:02,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 17:00:02,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 17:00:02,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 05:00:01" (1/3) ... [2024-05-30 17:00:02,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a8e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:00:02, skipping insertion in model container [2024-05-30 17:00:02,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:00:01" (2/3) ... [2024-05-30 17:00:02,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a8e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:00:02, skipping insertion in model container [2024-05-30 17:00:02,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:00:02" (3/3) ... [2024-05-30 17:00:02,098 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-05-30 17:00:02,106 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 17:00:02,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 17:00:02,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 17:00:02,113 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 17:00:02,148 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 17:00:02,180 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:00:02,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 17:00:02,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:02,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 17:00:02,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 17:00:02,218 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 17:00:02,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 17:00:02,229 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;@3784e67f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:00:02,229 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 17:00:02,238 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:02,340 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:02,341 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:02,341 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:02,373 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:02,373 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:02,373 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:02,397 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:02,398 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:02,398 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:02,456 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 238 states. [2024-05-30 17:00:02,456 INFO L212 cStratifiedReduction]: Copied states 9 times. [2024-05-30 17:00:02,459 INFO L78 Accepts]: Start accepts. Automaton has currently 233 states, but on-demand construction may add more states Word has length 153 [2024-05-30 17:00:02,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:02,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:02,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1336729450, now seen corresponding path program 1 times [2024-05-30 17:00:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:02,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4295442] [2024-05-30 17:00:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-30 17:00:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:02,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4295442] [2024-05-30 17:00:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4295442] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:00:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:00:02,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 17:00:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38528743] [2024-05-30 17:00:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:00:02,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 17:00:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:02,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 17:00:02,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 17:00:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:02,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:02,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:02,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:02,787 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:02,856 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:02,857 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:02,857 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:02,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:02,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:02,875 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:02,899 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:02,899 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:02,899 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:02,946 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 267 states. [2024-05-30 17:00:02,947 INFO L212 cStratifiedReduction]: Copied states 9 times. [2024-05-30 17:00:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:02,947 INFO L78 Accepts]: Start accepts. Automaton has currently 262 states, but on-demand construction may add more states Word has length 148 [2024-05-30 17:00:02,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:02,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 17:00:02,951 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:02,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1128140544, now seen corresponding path program 1 times [2024-05-30 17:00:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635840430] [2024-05-30 17:00:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 17:00:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:03,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635840430] [2024-05-30 17:00:03,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635840430] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:00:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:00:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 17:00:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385206528] [2024-05-30 17:00:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:00:03,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 17:00:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:03,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 17:00:03,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 17:00:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:03,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:03,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,287 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:03,428 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:03,428 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:03,428 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:03,453 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:03,453 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:03,453 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:03,466 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:03,466 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:03,467 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:03,500 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 275 states. [2024-05-30 17:00:03,500 INFO L212 cStratifiedReduction]: Copied states 9 times. [2024-05-30 17:00:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:03,500 INFO L78 Accepts]: Start accepts. Automaton has currently 270 states, but on-demand construction may add more states Word has length 156 [2024-05-30 17:00:03,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:03,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 17:00:03,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:03,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1695080500, now seen corresponding path program 1 times [2024-05-30 17:00:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:03,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673078446] [2024-05-30 17:00:03,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 17:00:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673078446] [2024-05-30 17:00:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673078446] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:00:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:00:03,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 17:00:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598416508] [2024-05-30 17:00:03,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:00:03,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 17:00:03,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 17:00:03,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 17:00:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:03,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:03,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,727 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:03,809 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:03,810 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:03,810 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:03,825 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:03,825 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:03,825 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:03,839 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:03,839 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:03,840 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:03,865 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 283 states. [2024-05-30 17:00:03,865 INFO L212 cStratifiedReduction]: Copied states 9 times. [2024-05-30 17:00:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:03,865 INFO L78 Accepts]: Start accepts. Automaton has currently 278 states, but on-demand construction may add more states Word has length 164 [2024-05-30 17:00:03,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:03,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 17:00:03,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:03,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2017402956, now seen corresponding path program 1 times [2024-05-30 17:00:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74556] [2024-05-30 17:00:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:03,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:00:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74556] [2024-05-30 17:00:04,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74556] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:00:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117394413] [2024-05-30 17:00:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:04,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:04,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:04,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:00:04,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 17:00:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:04,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-30 17:00:04,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:00:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:00:04,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:00:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:00:04,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117394413] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:00:04,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:00:04,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-05-30 17:00:04,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778978862] [2024-05-30 17:00:04,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:00:04,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 17:00:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 17:00:04,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-05-30 17:00:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:04,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:04,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.736842105263158) internal successors, (223), 19 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:04,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:04,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:04,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:04,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:04,701 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:04,919 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:04,919 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:04,919 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:04,925 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:04,925 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:04,925 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:04,930 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:04,931 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:00:04,931 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:00:04,950 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 292 states. [2024-05-30 17:00:04,950 INFO L212 cStratifiedReduction]: Copied states 9 times. [2024-05-30 17:00:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:04,951 INFO L78 Accepts]: Start accepts. Automaton has currently 287 states, but on-demand construction may add more states Word has length 172 [2024-05-30 17:00:04,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:04,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 17:00:05,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:05,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:05,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash -140523420, now seen corresponding path program 2 times [2024-05-30 17:00:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:05,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928247611] [2024-05-30 17:00:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:05,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 17:00:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928247611] [2024-05-30 17:00:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928247611] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:00:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655968756] [2024-05-30 17:00:05,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 17:00:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:05,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:05,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:00:05,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 17:00:05,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 17:00:05,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:00:05,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 17:00:05,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:00:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-30 17:00:05,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 17:00:05,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655968756] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:00:05,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 17:00:05,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-05-30 17:00:05,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217312143] [2024-05-30 17:00:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:00:05,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-30 17:00:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:05,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-30 17:00:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-30 17:00:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:05,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:05,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:05,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:05,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:05,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:05,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:05,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:05,578 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:05,642 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 291 states. [2024-05-30 17:00:05,642 INFO L212 cStratifiedReduction]: Copied states 3 times. [2024-05-30 17:00:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:05,643 INFO L78 Accepts]: Start accepts. Automaton has currently 295 states, but on-demand construction may add more states Word has length 190 [2024-05-30 17:00:05,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:05,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 17:00:05,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:05,849 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:05,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:05,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1212996086, now seen corresponding path program 3 times [2024-05-30 17:00:05,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:05,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94963634] [2024-05-30 17:00:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-05-30 17:00:06,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94963634] [2024-05-30 17:00:06,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94963634] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:00:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068354762] [2024-05-30 17:00:06,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 17:00:06,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:06,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:06,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:00:06,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 17:00:06,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 17:00:06,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:00:06,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 17:00:06,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:00:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-05-30 17:00:06,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:00:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-05-30 17:00:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068354762] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:00:06,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:00:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-05-30 17:00:06,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776944729] [2024-05-30 17:00:06,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:00:06,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 17:00:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 17:00:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-05-30 17:00:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:06,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:06,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.157894736842104) internal successors, (250), 19 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:06,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:06,838 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:07,086 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 300 states. [2024-05-30 17:00:07,086 INFO L212 cStratifiedReduction]: Copied states 3 times. [2024-05-30 17:00:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:07,087 INFO L78 Accepts]: Start accepts. Automaton has currently 304 states, but on-demand construction may add more states Word has length 198 [2024-05-30 17:00:07,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:07,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-30 17:00:07,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:07,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:07,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1344918590, now seen corresponding path program 4 times [2024-05-30 17:00:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316130984] [2024-05-30 17:00:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-05-30 17:00:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316130984] [2024-05-30 17:00:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316130984] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:00:07,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115482172] [2024-05-30 17:00:07,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 17:00:07,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:07,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:07,591 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-30 17:00:07,593 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-30 17:00:07,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 17:00:07,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:00:07,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 17:00:07,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:00:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-30 17:00:07,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:00:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-30 17:00:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115482172] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:00:08,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:00:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 5] total 17 [2024-05-30 17:00:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591907957] [2024-05-30 17:00:08,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:00:08,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-30 17:00:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:08,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-30 17:00:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-05-30 17:00:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:08,098 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:08,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 23.529411764705884) internal successors, (400), 17 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:08,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:08,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:08,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:08,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:08,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:08,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:08,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:08,099 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:08,428 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 324 states. [2024-05-30 17:00:08,428 INFO L212 cStratifiedReduction]: Copied states 1 times. [2024-05-30 17:00:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:00:08,429 INFO L78 Accepts]: Start accepts. Automaton has currently 329 states, but on-demand construction may add more states Word has length 218 [2024-05-30 17:00:08,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:08,438 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-30 17:00:08,635 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,SelfDestructingSolverStorable6 [2024-05-30 17:00:08,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:08,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1130206850, now seen corresponding path program 5 times [2024-05-30 17:00:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29153481] [2024-05-30 17:00:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 52 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-05-30 17:00:08,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29153481] [2024-05-30 17:00:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29153481] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:00:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425450809] [2024-05-30 17:00:08,972 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 17:00:08,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:08,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:08,973 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-30 17:00:08,975 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-30 17:00:09,097 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-05-30 17:00:09,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:00:09,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 17:00:09,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:00:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-05-30 17:00:09,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:00:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 40 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-05-30 17:00:09,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425450809] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:00:09,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:00:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 9] total 25 [2024-05-30 17:00:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923916606] [2024-05-30 17:00:09,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:00:09,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-30 17:00:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-30 17:00:09,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-05-30 17:00:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:09,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:09,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 17.48) internal successors, (437), 25 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:00:09,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:09,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:09,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:09,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:09,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:09,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:09,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:00:09,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:09,676 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:00:10,027 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 316 states. [2024-05-30 17:00:10,027 INFO L212 cStratifiedReduction]: Copied states 1 times. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:00:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:00:10,027 INFO L78 Accepts]: Start accepts. Automaton has currently 323 states, but on-demand construction may add more states Word has length 202 [2024-05-30 17:00:10,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:00:10,036 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-30 17:00:10,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:10,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:00:10,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:00:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1186192302, now seen corresponding path program 6 times [2024-05-30 17:00:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:00:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241629291] [2024-05-30 17:00:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:00:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:00:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:00:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:00:16,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:00:16,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241629291] [2024-05-30 17:00:16,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241629291] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:00:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250458922] [2024-05-30 17:00:16,297 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 17:00:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:00:16,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:00:16,298 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-30 17:00:16,300 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-30 17:00:16,436 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-05-30 17:00:16,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:00:16,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 79 conjunts are in the unsatisfiable core [2024-05-30 17:00:16,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:00:18,146 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-30 17:00:18,612 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-30 17:00:18,692 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-30 17:00:20,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:00:20,144 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 51 treesize of output 39 [2024-05-30 17:00:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 17:00:20,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:00:38,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:00:38,398 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 231 treesize of output 147 [2024-05-30 17:00:38,458 INFO L349 Elim1Store]: treesize reduction 9, result has 90.7 percent of original size [2024-05-30 17:00:38,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2125 treesize of output 1880 [2024-05-30 17:00:38,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:00:38,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:00:38,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 888 treesize of output 692 [2024-05-30 17:00:38,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:00:38,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:00:38,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 607 treesize of output 546 [2024-05-30 17:00:50,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:00:50,019 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 231 treesize of output 147 [2024-05-30 17:00:50,059 INFO L349 Elim1Store]: treesize reduction 55, result has 43.3 percent of original size [2024-05-30 17:00:50,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1097 treesize of output 963 [2024-05-30 17:00:50,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:00:50,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:00:50,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:00:50,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 910 treesize of output 650 [2024-05-30 17:00:50,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:00:50,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:00:50,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:00:50,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 595 treesize of output 481 [2024-05-30 17:00:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 17:00:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250458922] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:00:53,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:00:53,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 45, 38] total 125 [2024-05-30 17:00:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135812058] [2024-05-30 17:00:53,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:00:53,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2024-05-30 17:00:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:00:53,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2024-05-30 17:00:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=13740, Unknown=104, NotChecked=0, Total=15500 [2024-05-30 17:00:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:53,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:00:53,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 4.248) internal successors, (531), 125 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-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:00:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:00:53,650 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:01:08,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:16,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:18,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:20,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:22,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:24,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:34,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:36,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:38,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:40,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:42,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:44,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:46,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:48,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:50,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:52,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:54,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:56,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:01:58,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:00,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:02,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:04,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:06,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:09,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:11,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:13,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:15,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:17,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:19,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:21,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:23,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:25,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:27,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:29,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:31,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:33,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:35,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:46,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:48,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:56,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:02:58,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:01,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:03,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:05,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:07,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:09,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:11,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:17,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:19,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:21,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:23,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:25,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:27,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:29,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:31,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:34,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:36,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:38,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:40,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:42,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:46,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:48,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:50,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:52,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:54,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:56,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:03:58,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:04:00,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:04:03,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:04:04,419 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 337 states. [2024-05-30 17:04:04,420 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:04:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-05-30 17:04:04,420 INFO L78 Accepts]: Start accepts. Automaton has currently 344 states, but on-demand construction may add more states Word has length 230 [2024-05-30 17:04:04,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:04:04,429 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-30 17:04:04,627 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,SelfDestructingSolverStorable8 [2024-05-30 17:04:04,628 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:04:04,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:04:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -160260858, now seen corresponding path program 7 times [2024-05-30 17:04:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:04:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468205400] [2024-05-30 17:04:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:04:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:04:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:04:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:04:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:04:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468205400] [2024-05-30 17:04:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468205400] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:04:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834335120] [2024-05-30 17:04:12,608 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 17:04:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:04:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:04:12,609 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-30 17:04:12,610 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-30 17:04:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:04:12,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 89 conjunts are in the unsatisfiable core [2024-05-30 17:04:12,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:04:17,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:04:17,375 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 51 treesize of output 39 [2024-05-30 17:04:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 3 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:04:17,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:04:19,170 INFO L349 Elim1Store]: treesize reduction 22, result has 90.0 percent of original size [2024-05-30 17:04:19,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 232 [2024-05-30 17:04:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 3 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:04:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834335120] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:04:26,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:04:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 50, 50] total 156 [2024-05-30 17:04:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474629347] [2024-05-30 17:04:26,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:04:26,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2024-05-30 17:04:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:04:26,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2024-05-30 17:04:26,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2203, Invalid=21977, Unknown=0, NotChecked=0, Total=24180 [2024-05-30 17:04:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:26,592 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:04:26,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 156 states have (on average 3.923076923076923) internal successors, (612), 156 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:04:26,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:26,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:26,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:26,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:04:26,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:04:26,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:04:26,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:04:26,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:04:26,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-05-30 17:04:26,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:26,593 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:04:39,865 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 504 states. [2024-05-30 17:04:39,865 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:04:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:04:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:04:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:04:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:04:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:04:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:04:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:04:39,866 INFO L78 Accepts]: Start accepts. Automaton has currently 555 states, but on-demand construction may add more states Word has length 250 [2024-05-30 17:04:39,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:04:39,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-05-30 17:04:40,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:04:40,072 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:04:40,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:04:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2084006878, now seen corresponding path program 8 times [2024-05-30 17:04:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:04:40,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645645913] [2024-05-30 17:04:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:04:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:04:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:04:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 5 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:04:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:04:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645645913] [2024-05-30 17:04:45,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645645913] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:04:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654680770] [2024-05-30 17:04:45,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 17:04:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:04:45,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:04:45,529 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-30 17:04:45,529 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-30 17:04:45,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 17:04:45,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:04:45,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 109 conjunts are in the unsatisfiable core [2024-05-30 17:04:45,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:04:49,004 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-30 17:04:49,627 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-30 17:04:49,748 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-30 17:04:54,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:04:54,712 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 47 treesize of output 37 [2024-05-30 17:04:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 7 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:04:54,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:05:04,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:05:04,873 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 233 treesize of output 149 [2024-05-30 17:05:04,943 INFO L349 Elim1Store]: treesize reduction 9, result has 90.3 percent of original size [2024-05-30 17:05:04,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2157 treesize of output 1898 [2024-05-30 17:05:04,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:05:05,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:05:05,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 850 treesize of output 782 [2024-05-30 17:05:05,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:05:05,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:05:05,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 772 treesize of output 564 [2024-05-30 17:05:24,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:05:24,147 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 233 treesize of output 149 [2024-05-30 17:05:24,190 INFO L349 Elim1Store]: treesize reduction 51, result has 45.2 percent of original size [2024-05-30 17:05:24,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1117 treesize of output 978 [2024-05-30 17:05:24,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:05:24,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:24,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:05:24,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 925 treesize of output 653 [2024-05-30 17:05:24,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 17:05:24,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:24,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:05:24,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 600 treesize of output 479 [2024-05-30 17:05:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:05:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654680770] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:05:31,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:05:31,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 62] total 183 [2024-05-30 17:05:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064003724] [2024-05-30 17:05:31,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:05:31,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 183 states [2024-05-30 17:05:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:05:31,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2024-05-30 17:05:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2868, Invalid=30310, Unknown=128, NotChecked=0, Total=33306 [2024-05-30 17:05:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:31,104 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:05:31,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 183 states, 183 states have (on average 3.6721311475409837) internal successors, (672), 183 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:05:31,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:05:31,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:31,105 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:05:57,485 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 395 states. [2024-05-30 17:05:57,485 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:05:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:05:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 17:05:57,486 INFO L78 Accepts]: Start accepts. Automaton has currently 411 states, but on-demand construction may add more states Word has length 270 [2024-05-30 17:05:57,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:05:57,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-30 17:05:57,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:05:57,690 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:05:57,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:05:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 255593246, now seen corresponding path program 9 times [2024-05-30 17:05:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:05:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088350275] [2024-05-30 17:05:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:05:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:05:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:05:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 92 proven. 84 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-05-30 17:05:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:05:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088350275] [2024-05-30 17:05:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088350275] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:05:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236061482] [2024-05-30 17:05:58,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 17:05:58,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:05:58,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:05:58,175 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-30 17:05:58,177 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-30 17:05:58,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-30 17:05:58,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:05:58,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-30 17:05:58,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:05:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 124 proven. 52 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-05-30 17:05:59,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:05:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 86 proven. 90 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-05-30 17:05:59,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236061482] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:05:59,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:05:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2024-05-30 17:05:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193383260] [2024-05-30 17:05:59,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:05:59,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-30 17:05:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:05:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-05-30 17:05:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2257, Unknown=0, NotChecked=0, Total=2550 [2024-05-30 17:05:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:59,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:05:59,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 9.352941176470589) internal successors, (477), 51 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:05:59,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 17:05:59,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:59,769 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:06:00,731 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 404 states. [2024-05-30 17:06:00,731 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:06:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 17:06:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:06:00,733 INFO L78 Accepts]: Start accepts. Automaton has currently 420 states, but on-demand construction may add more states Word has length 278 [2024-05-30 17:06:00,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:06:00,740 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-30 17:06:00,934 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,SelfDestructingSolverStorable11 [2024-05-30 17:06:00,935 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:06:00,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:06:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1062013238, now seen corresponding path program 10 times [2024-05-30 17:06:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:06:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850926786] [2024-05-30 17:06:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:06:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:06:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:06:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:06:06,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:06:06,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850926786] [2024-05-30 17:06:06,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850926786] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:06:06,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844116130] [2024-05-30 17:06:06,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 17:06:06,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:06:06,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:06:06,829 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-30 17:06:06,831 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-30 17:06:06,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 17:06:06,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:06:06,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 105 conjunts are in the unsatisfiable core [2024-05-30 17:06:06,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:06:13,829 INFO L349 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2024-05-30 17:06:13,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 42 [2024-05-30 17:06:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 17 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:06:14,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:06:15,778 INFO L349 Elim1Store]: treesize reduction 22, result has 90.0 percent of original size [2024-05-30 17:06:15,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 232 [2024-05-30 17:06:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:06:27,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844116130] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:06:27,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:06:27,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 64, 64] total 190 [2024-05-30 17:06:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350837495] [2024-05-30 17:06:27,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:06:27,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2024-05-30 17:06:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:06:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2024-05-30 17:06:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3364, Invalid=32546, Unknown=0, NotChecked=0, Total=35910 [2024-05-30 17:06:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:27,923 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:06:27,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 190 states have (on average 3.8526315789473684) internal successors, (732), 190 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:06:27,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:27,924 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:06:40,503 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 416 states. [2024-05-30 17:06:40,503 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:06:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:06:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 17:06:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:06:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 17:06:40,504 INFO L78 Accepts]: Start accepts. Automaton has currently 432 states, but on-demand construction may add more states Word has length 294 [2024-05-30 17:06:40,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:06:40,513 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-30 17:06:40,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:06:40,706 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:06:40,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:06:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash -219173502, now seen corresponding path program 11 times [2024-05-30 17:06:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:06:40,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770195932] [2024-05-30 17:06:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:06:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:06:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:06:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 8 proven. 423 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:06:51,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:06:51,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770195932] [2024-05-30 17:06:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770195932] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:06:51,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008552349] [2024-05-30 17:06:51,194 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 17:06:51,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:06:51,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:06:51,195 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-30 17:06:51,197 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-30 17:06:51,463 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-05-30 17:06:51,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:06:51,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 67 conjunts are in the unsatisfiable core [2024-05-30 17:06:51,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:06:53,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:06:53,629 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 51 treesize of output 39 [2024-05-30 17:06:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 2 proven. 159 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-30 17:06:53,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:06:55,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:06:55,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 276 [2024-05-30 17:07:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-05-30 17:07:03,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008552349] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:07:03,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:07:03,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 27, 22] total 117 [2024-05-30 17:07:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638407654] [2024-05-30 17:07:03,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:07:03,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2024-05-30 17:07:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:07:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2024-05-30 17:07:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=13049, Unknown=0, NotChecked=0, Total=13572 [2024-05-30 17:07:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:03,371 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:07:03,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 4.119658119658119) internal successors, (482), 117 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 17:07:03,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:03,372 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:07:15,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:15,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:15,657 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:15,694 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:15,694 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:15,694 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:15,708 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:15,708 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:15,708 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,252 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,253 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:07:26,253 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,352 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,353 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,353 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,353 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,419 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,420 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,420 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,424 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,424 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,424 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,440 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,440 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,440 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,466 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,466 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,466 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,498 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,498 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,498 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,528 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:26,529 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:26,529 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:28,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:30,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:32,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:34,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:36,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:38,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:40,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:42,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:44,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:46,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:50,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:52,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:54,307 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1998 states. [2024-05-30 17:07:54,307 INFO L212 cStratifiedReduction]: Copied states 830 times. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-05-30 17:07:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-30 17:07:54,308 INFO L78 Accepts]: Start accepts. Automaton has currently 1331 states, but on-demand construction may add more states Word has length 242 [2024-05-30 17:07:54,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:07:54,321 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-30 17:07:54,516 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,SelfDestructingSolverStorable13 [2024-05-30 17:07:54,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:07:54,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:07:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1701882210, now seen corresponding path program 1 times [2024-05-30 17:07:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:07:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701388336] [2024-05-30 17:07:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:07:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:07:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:07:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-05-30 17:07:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:07:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701388336] [2024-05-30 17:07:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701388336] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:07:54,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:07:54,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 17:07:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530127444] [2024-05-30 17:07:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:07:54,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 17:07:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:07:54,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 17:07:54,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 17:07:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:54,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:07:54,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-30 17:07:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:54,669 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:07:54,847 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:54,848 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:54,848 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:54,852 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:54,852 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:54,853 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:54,866 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:54,866 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:54,866 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:54,990 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:54,991 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:07:54,991 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,076 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,077 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,077 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,077 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,077 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,078 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,157 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,158 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,158 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,162 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,175 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,175 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,175 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,200 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,200 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,200 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,300 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,300 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,300 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,325 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:55,326 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:55,326 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:59,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:01,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:03,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:05,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:07,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:09,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:12,864 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2285 states. [2024-05-30 17:08:12,864 INFO L212 cStratifiedReduction]: Copied states 829 times. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:08:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-05-30 17:08:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:08:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-05-30 17:08:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:08:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:08:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 17:08:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:12,865 INFO L78 Accepts]: Start accepts. Automaton has currently 1677 states, but on-demand construction may add more states Word has length 254 [2024-05-30 17:08:12,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:12,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-30 17:08:12,867 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:12,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash 212016136, now seen corresponding path program 12 times [2024-05-30 17:08:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:12,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474945111] [2024-05-30 17:08:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-30 17:08:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474945111] [2024-05-30 17:08:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474945111] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:08:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131832372] [2024-05-30 17:08:19,955 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 17:08:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:19,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:08:19,956 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-30 17:08:19,957 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-30 17:08:20,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-05-30 17:08:20,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:08:20,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-30 17:08:20,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:08:22,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:08:22,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-05-30 17:08:22,641 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-05-30 17:08:22,641 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 60 treesize of output 20 [2024-05-30 17:08:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-05-30 17:08:22,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:08:23,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (* c_~q1_back~0 4)) (.cse2 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_725 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= (select .cse0 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (select .cse0 (+ .cse2 ~q1~0.offset)) c_~N~0)))) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0)))) (forall ((v_ArrVal_725 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725))) (or (< (select (select .cse5 c_~q2~0.base) .cse4) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (not (= (select .cse6 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (+ (select .cse6 (+ .cse2 ~q1~0.offset)) 1) c_~N~0))))))))) is different from false [2024-05-30 17:08:23,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:08:23,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2024-05-30 17:08:23,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:08:23,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 174 [2024-05-30 17:08:23,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:08:23,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 156 [2024-05-30 17:09:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-05-30 17:09:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131832372] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:09:26,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:09:26,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 26, 26] total 106 [2024-05-30 17:09:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740362314] [2024-05-30 17:09:26,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:09:26,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-05-30 17:09:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-05-30 17:09:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=10119, Unknown=1, NotChecked=206, Total=11130 [2024-05-30 17:09:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:26,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:26,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 4.915094339622642) internal successors, (521), 106 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:26,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:26,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:09:26,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:26,403 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:33,504 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,504 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,504 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,508 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,508 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,508 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,521 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,521 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,740 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,740 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:33,741 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,818 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,818 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,818 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,818 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,871 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,872 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,872 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,875 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,886 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,887 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,887 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,907 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,907 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,907 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,932 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,932 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,932 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,957 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:33,957 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:33,957 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:36,198 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:36,198 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:36,198 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:36,389 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:36,389 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:36,389 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,715 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,715 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~q1_back~0, ~q1_front~0] [2024-05-30 17:09:55,715 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,827 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,828 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,828 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,831 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,831 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~q1_back~0, ~q1_front~0] [2024-05-30 17:09:55,831 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,835 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,835 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,862 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,863 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~q1_back~0, ~q1_front~0] [2024-05-30 17:09:55,863 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,924 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,924 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,924 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,927 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,928 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,928 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,940 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:55,941 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:55,941 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:02,397 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4255 states. [2024-05-30 17:10:02,397 INFO L212 cStratifiedReduction]: Copied states 1777 times. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:10:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-05-30 17:10:02,398 INFO L78 Accepts]: Start accepts. Automaton has currently 2912 states, but on-demand construction may add more states Word has length 354 [2024-05-30 17:10:02,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:10:02,407 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-30 17:10:02,603 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-30 17:10:02,604 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:10:02,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:10:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash -556903530, now seen corresponding path program 13 times [2024-05-30 17:10:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:10:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023809825] [2024-05-30 17:10:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:10:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:10:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:10:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 214 proven. 310 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-05-30 17:10:03,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:10:03,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023809825] [2024-05-30 17:10:03,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023809825] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:10:03,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377298506] [2024-05-30 17:10:03,146 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 17:10:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:10:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:10:03,147 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-30 17:10:03,149 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-30 17:10:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:10:03,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-30 17:10:03,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:10:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 427 proven. 85 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-05-30 17:10:03,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:10:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 372 proven. 140 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-05-30 17:10:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377298506] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:10:04,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:10:04,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2024-05-30 17:10:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658421305] [2024-05-30 17:10:04,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:10:04,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-05-30 17:10:04,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:10:04,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-05-30 17:10:04,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=2598, Unknown=0, NotChecked=0, Total=3080 [2024-05-30 17:10:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:10:04,636 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:10:04,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 8.232142857142858) internal successors, (461), 56 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 168 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-05-30 17:10:04,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:10:04,637 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:10:05,385 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,385 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~q1_back~0, ~q1_front~0] [2024-05-30 17:10:05,385 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,422 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,422 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,423 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,426 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,426 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~q1_back~0, ~q1_front~0] [2024-05-30 17:10:05,426 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,429 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,429 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,429 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,444 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,444 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~q1_back~0, ~q1_front~0] [2024-05-30 17:10:05,444 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,457 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,458 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,458 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,579 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,579 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:10:05,579 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,597 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,597 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,597 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,816 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,816 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,816 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,820 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,820 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,820 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,835 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,835 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,991 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:05,992 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:05,992 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:06,056 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:06,056 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:10:06,056 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:06,222 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:10:06,222 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:06,222 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~ret16#1.offset, ~q2_back~0, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~n2~0, ~q1~0.base, ULTIMATE.start_main_#t~ret17#1.base, ~q2_front~0, ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~q1_front~0, thread1Thread1of1ForFork0_#t~post5#1, ~N~0, ~i~0, ~j~0, #valid, thread2Thread1of1ForFork1_#t~post10#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post25#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:10:17,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:19,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:21,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:31,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:33,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:35,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:37,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:39,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:41,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:43,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:45,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:47,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:49,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:51,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:53,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:55,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:10:57,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:10,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:12,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:14,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:16,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:18,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:20,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:22,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:24,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:26,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:28,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:30,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:32,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:34,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:37,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:40,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:52,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:11:55,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:12:40,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:12:42,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:12:44,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:12:46,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 17:12:47,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-05-30 17:12:47,172 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-05-30 17:12:47,172 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 13598 states. [2024-05-30 17:12:47,172 INFO L212 cStratifiedReduction]: Copied states 4696 times. [2024-05-30 17:12:47,178 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-30 17:12:47,373 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-30 17:12:47,374 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.createSuccessors(DynamicStratifiedReduction.java:506) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.traverse(DynamicStratifiedReduction.java:320) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.run(DynamicStratifiedReduction.java:203) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.traverseWithDynamicStratified(PartialOrderReductionFacade.java:427) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:400) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 53 more [2024-05-30 17:12:47,377 INFO L158 Benchmark]: Toolchain (without parser) took 766068.58ms. Allocated memory was 320.9MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 248.0MB in the beginning and 511.7MB in the end (delta: -263.7MB). Peak memory consumption was 855.6MB. Max. memory is 8.0GB. [2024-05-30 17:12:47,377 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 320.9MB. Free memory is still 288.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 17:12:47,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.04ms. Allocated memory is still 320.9MB. Free memory was 247.7MB in the beginning and 235.5MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 17:12:47,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.06ms. Allocated memory is still 320.9MB. Free memory was 235.5MB in the beginning and 232.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 17:12:47,377 INFO L158 Benchmark]: Boogie Preprocessor took 38.54ms. Allocated memory is still 320.9MB. Free memory was 232.8MB in the beginning and 230.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:12:47,378 INFO L158 Benchmark]: RCFGBuilder took 521.15ms. Allocated memory is still 320.9MB. Free memory was 230.9MB in the beginning and 272.4MB in the end (delta: -41.5MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2024-05-30 17:12:47,378 INFO L158 Benchmark]: TraceAbstraction took 765282.66ms. Allocated memory was 320.9MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 270.8MB in the beginning and 511.7MB in the end (delta: -240.8MB). Peak memory consumption was 876.9MB. Max. memory is 8.0GB. [2024-05-30 17:12:47,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 320.9MB. Free memory is still 288.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.04ms. Allocated memory is still 320.9MB. Free memory was 247.7MB in the beginning and 235.5MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.06ms. Allocated memory is still 320.9MB. Free memory was 235.5MB in the beginning and 232.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.54ms. Allocated memory is still 320.9MB. Free memory was 232.8MB in the beginning and 230.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 521.15ms. Allocated memory is still 320.9MB. Free memory was 230.9MB in the beginning and 272.4MB in the end (delta: -41.5MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. * TraceAbstraction took 765282.66ms. Allocated memory was 320.9MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 270.8MB in the beginning and 511.7MB in the end (delta: -240.8MB). Peak memory consumption was 876.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-05-30 17:12:47,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...