/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-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:30:29,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:30:29,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:30:29,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:30:29,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:30:29,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:30:30,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:30:30,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:30:30,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:30:30,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:30:30,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:30:30,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:30:30,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:30:30,018 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:30:30,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:30:30,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:30:30,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:30:30,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:30:30,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:30:30,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:30:30,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:30:30,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:30:30,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:30:30,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:30:30,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:30:30,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:30:30,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:30:30,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:30:30,021 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:30:30,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:30:30,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:30:30,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:30:30,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:30:30,022 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:30:30,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:30:30,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:30:30,023 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:30:30,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:30:30,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:30:30,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:30:30,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:30:30,023 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 16:30:30,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:30:30,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:30:30,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:30:30,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:30:30,235 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:30:30,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2024-05-30 16:30:31,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:30:31,433 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:30:31,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2024-05-30 16:30:31,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f03e6e18a/9ca890b4ab3149f896f346c86abf9d3b/FLAGb5c0129a5 [2024-05-30 16:30:31,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f03e6e18a/9ca890b4ab3149f896f346c86abf9d3b [2024-05-30 16:30:31,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:30:31,455 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:30:31,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:30:31,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:30:31,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:30:31,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e661054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31, skipping insertion in model container [2024-05-30 16:30:31,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,477 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:30:31,616 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-horseshoe.wvr.c[3424,3437] [2024-05-30 16:30:31,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:30:31,629 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:30:31,645 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-horseshoe.wvr.c[3424,3437] [2024-05-30 16:30:31,648 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:30:31,659 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:30:31,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31 WrapperNode [2024-05-30 16:30:31,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:30:31,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:30:31,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:30:31,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:30:31,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,692 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 254 [2024-05-30 16:30:31,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:30:31,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:30:31,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:30:31,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:30:31,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:30:31,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:30:31,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:30:31,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:30:31,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (1/1) ... [2024-05-30 16:30:31,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:30:31,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:31,750 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 16:30:31,777 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 16:30:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:30:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:30:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:30:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:30:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:30:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:30:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 16:30:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:30:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:30:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:30:31,797 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 16:30:31,870 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:30:31,871 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:30:32,139 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:30:32,244 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:30:32,244 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2024-05-30 16:30:32,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:30:32 BoogieIcfgContainer [2024-05-30 16:30:32,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:30:32,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:30:32,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:30:32,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:30:32,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:30:31" (1/3) ... [2024-05-30 16:30:32,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c82937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:30:32, skipping insertion in model container [2024-05-30 16:30:32,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:30:31" (2/3) ... [2024-05-30 16:30:32,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c82937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:30:32, skipping insertion in model container [2024-05-30 16:30:32,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:30:32" (3/3) ... [2024-05-30 16:30:32,255 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2024-05-30 16:30:32,261 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:30:32,271 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:30:32,271 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:30:32,271 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:30:32,338 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-30 16:30:32,385 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:30:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:30:32,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:32,388 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 16:30:32,394 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 16:30:32,434 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:30:32,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:30:32,448 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;@3cde1f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:30:32,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:30:32,456 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:32,603 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,604 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,604 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,634 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,635 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,635 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,667 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,667 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,668 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,701 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,701 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,701 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,746 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,746 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,746 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,808 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,808 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,808 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,826 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,826 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,826 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,856 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,857 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,857 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,864 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,865 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,865 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,868 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,868 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,868 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,876 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,876 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,893 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,893 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,894 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,911 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,912 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,912 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,928 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,928 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,928 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,949 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,949 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,949 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:32,959 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:32,960 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:32,960 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,016 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,016 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,016 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,029 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,029 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,043 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,043 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,043 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,047 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,048 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,048 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,052 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,052 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,052 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,058 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,058 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,058 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,069 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,069 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,070 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,078 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,078 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,079 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,087 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,088 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,088 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,101 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,101 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,101 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,108 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,108 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,108 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,149 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,149 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,149 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,160 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,160 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,160 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,171 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,172 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,172 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,176 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,176 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,176 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,179 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,179 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,186 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,186 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,186 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,205 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 483 states. [2024-05-30 16:30:33,206 INFO L212 cStratifiedReduction]: Copied states 21 times. [2024-05-30 16:30:33,208 INFO L78 Accepts]: Start accepts. Automaton has currently 529 states, but on-demand construction may add more states Word has length 172 [2024-05-30 16:30:33,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:33,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:33,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash -876336519, now seen corresponding path program 1 times [2024-05-30 16:30:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378429272] [2024-05-30 16:30:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378429272] [2024-05-30 16:30:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378429272] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:30:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:30:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:30:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40481975] [2024-05-30 16:30:33,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:30:33,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:30:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:30:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:30:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:33,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:33,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 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 16:30:33,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:33,593 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:33,638 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,639 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,639 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,643 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,643 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,643 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,649 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,649 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,649 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,656 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,656 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,656 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,662 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,663 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,663 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,693 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,694 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,694 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,703 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,703 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,704 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,713 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,714 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,715 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,715 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,715 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,718 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,718 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,719 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,725 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,725 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,725 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,730 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,730 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,730 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,738 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,739 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,739 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,744 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,745 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,745 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,750 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,750 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,751 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,777 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,777 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,778 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,784 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,784 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,784 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,792 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,792 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,792 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,792 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,792 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,793 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,794 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,797 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,797 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,801 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,801 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,801 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,808 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,808 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,808 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,812 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,812 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,812 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,817 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,817 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,817 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,825 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,825 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,825 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,829 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,830 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,830 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,852 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,853 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,853 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,859 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,859 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,859 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,870 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,871 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,871 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,871 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,871 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,871 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,873 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,873 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,873 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,877 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:33,878 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:33,878 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:30:33,893 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 527 states. [2024-05-30 16:30:33,893 INFO L212 cStratifiedReduction]: Copied states 21 times. [2024-05-30 16:30:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:33,893 INFO L78 Accepts]: Start accepts. Automaton has currently 588 states, but on-demand construction may add more states Word has length 166 [2024-05-30 16:30:33,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:33,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:30:33,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:33,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash -667950484, now seen corresponding path program 1 times [2024-05-30 16:30:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342497378] [2024-05-30 16:30:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:30:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:34,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342497378] [2024-05-30 16:30:34,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342497378] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:30:34,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:30:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 16:30:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349383601] [2024-05-30 16:30:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:30:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 16:30:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 16:30:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 16:30:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,288 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:34,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 16:30:34,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,289 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:34,346 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 282 states. [2024-05-30 16:30:34,346 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:30:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:34,347 INFO L78 Accepts]: Start accepts. Automaton has currently 284 states, but on-demand construction may add more states Word has length 171 [2024-05-30 16:30:34,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:34,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:30:34,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:34,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1932033530, now seen corresponding path program 2 times [2024-05-30 16:30:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441695342] [2024-05-30 16:30:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-30 16:30:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441695342] [2024-05-30 16:30:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441695342] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:30:34,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:30:34,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:30:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027667911] [2024-05-30 16:30:34,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:30:34,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:30:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:34,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:30:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:30:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:34,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:30:34,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:34,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,631 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:34,755 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 290 states. [2024-05-30 16:30:34,755 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:30:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:34,756 INFO L78 Accepts]: Start accepts. Automaton has currently 292 states, but on-demand construction may add more states Word has length 179 [2024-05-30 16:30:34,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:34,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 16:30:34,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:34,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1087323415, now seen corresponding path program 1 times [2024-05-30 16:30:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084312660] [2024-05-30 16:30:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:34,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-30 16:30:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084312660] [2024-05-30 16:30:34,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084312660] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:30:34,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:30:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:30:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507676882] [2024-05-30 16:30:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:30:34,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:30:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:30:34,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:30:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,923 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:34,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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 16:30:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:34,924 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:35,005 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 298 states. [2024-05-30 16:30:35,005 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:30:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:35,006 INFO L78 Accepts]: Start accepts. Automaton has currently 300 states, but on-demand construction may add more states Word has length 187 [2024-05-30 16:30:35,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:35,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 16:30:35,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:35,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1544820991, now seen corresponding path program 1 times [2024-05-30 16:30:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:35,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651576269] [2024-05-30 16:30:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651576269] [2024-05-30 16:30:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651576269] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500152899] [2024-05-30 16:30:35,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:35,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:35,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:35,322 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 16:30:35,344 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 16:30:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:35,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-30 16:30:35,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:35,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:35,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500152899] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:35,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:35,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-05-30 16:30:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318772021] [2024-05-30 16:30:35,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:35,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 16:30:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 16:30:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-05-30 16:30:35,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:35,862 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:35,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.842105263157896) internal successors, (244), 19 states have internal predecessors, (244), 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 16:30:35,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:35,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:35,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:35,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:35,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:35,863 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:36,129 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 307 states. [2024-05-30 16:30:36,129 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:30:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:36,130 INFO L78 Accepts]: Start accepts. Automaton has currently 309 states, but on-demand construction may add more states Word has length 195 [2024-05-30 16:30:36,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:36,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 16:30:36,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:36,337 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:36,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1300393456, now seen corresponding path program 2 times [2024-05-30 16:30:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026457345] [2024-05-30 16:30:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026457345] [2024-05-30 16:30:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026457345] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609863227] [2024-05-30 16:30:36,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:30:36,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:36,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:36,681 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 16:30:36,714 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 16:30:36,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:30:36,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:30:36,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-30 16:30:36,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:37,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609863227] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:37,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:37,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 36 [2024-05-30 16:30:37,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898935635] [2024-05-30 16:30:37,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:37,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-30 16:30:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:37,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-30 16:30:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2024-05-30 16:30:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:37,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:37,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 12.916666666666666) internal successors, (465), 36 states have internal predecessors, (465), 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 16:30:37,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:37,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:37,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:37,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:37,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:37,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:37,971 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:38,405 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 316 states. [2024-05-30 16:30:38,405 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:30:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:38,406 INFO L78 Accepts]: Start accepts. Automaton has currently 318 states, but on-demand construction may add more states Word has length 203 [2024-05-30 16:30:38,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:38,415 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 16:30:38,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:38,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:38,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1058444767, now seen corresponding path program 3 times [2024-05-30 16:30:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:38,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739328240] [2024-05-30 16:30:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:38,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:30:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739328240] [2024-05-30 16:30:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739328240] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420296548] [2024-05-30 16:30:39,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:30:39,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:39,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:39,613 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 16:30:39,637 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 16:30:39,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 16:30:39,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:30:39,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-30 16:30:39,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-30 16:30:40,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:40,103 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 16:30:40,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-30 16:30:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-30 16:30:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420296548] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:40,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:40,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5, 5] total 27 [2024-05-30 16:30:40,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908767103] [2024-05-30 16:30:40,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:40,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 16:30:40,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:40,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 16:30:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2024-05-30 16:30:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:40,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:40,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.555555555555555) internal successors, (366), 27 states have internal predecessors, (366), 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 16:30:40,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:40,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:40,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:40,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:40,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:40,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:40,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:40,224 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:41,041 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 337 states. [2024-05-30 16:30:41,041 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:30:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:30:41,042 INFO L78 Accepts]: Start accepts. Automaton has currently 339 states, but on-demand construction may add more states Word has length 216 [2024-05-30 16:30:41,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:41,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 16:30:41,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:41,244 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:41,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 655076414, now seen corresponding path program 1 times [2024-05-30 16:30:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198663218] [2024-05-30 16:30:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-05-30 16:30:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198663218] [2024-05-30 16:30:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198663218] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613395720] [2024-05-30 16:30:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:41,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:41,444 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 16:30:41,467 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 16:30:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:41,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-30 16:30:41,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-05-30 16:30:41,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-05-30 16:30:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613395720] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:41,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-05-30 16:30:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005991000] [2024-05-30 16:30:41,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:41,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 16:30:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 16:30:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-05-30 16:30:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:41,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:41,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 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 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:30:41,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:41,866 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:42,047 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 346 states. [2024-05-30 16:30:42,047 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:30:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:30:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:42,048 INFO L78 Accepts]: Start accepts. Automaton has currently 348 states, but on-demand construction may add more states Word has length 224 [2024-05-30 16:30:42,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:42,060 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 16:30:42,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-30 16:30:42,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:42,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -886707162, now seen corresponding path program 2 times [2024-05-30 16:30:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223622205] [2024-05-30 16:30:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:30:44,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:44,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223622205] [2024-05-30 16:30:44,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223622205] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:44,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866266823] [2024-05-30 16:30:44,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:30:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:44,412 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 16:30:44,415 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 16:30:44,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:30:44,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:30:44,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 55 conjunts are in the unsatisfiable core [2024-05-30 16:30:44,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:46,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:30:46,532 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 27 treesize of output 28 [2024-05-30 16:30:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:30:46,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:47,534 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-05-30 16:30:47,534 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 45 treesize of output 101 [2024-05-30 16:30:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:30:51,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866266823] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:51,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:51,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31, 31] total 81 [2024-05-30 16:30:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364623193] [2024-05-30 16:30:51,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:51,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-05-30 16:30:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:51,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-05-30 16:30:51,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=5722, Unknown=0, NotChecked=0, Total=6480 [2024-05-30 16:30:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:51,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:51,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 7.197530864197531) internal successors, (583), 81 states have internal predecessors, (583), 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 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:51,410 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:54,871 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:54,871 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:54,871 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:54,880 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:54,880 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:54,880 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:54,895 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:54,895 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:54,895 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:54,911 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:54,911 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:54,911 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,021 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,021 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:55,021 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,038 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,038 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,039 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,063 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,063 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,063 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,086 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,086 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,086 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,109 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,109 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,110 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,159 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,159 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,160 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,171 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,171 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,171 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,181 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,181 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,181 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,197 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,197 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,197 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,207 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,207 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,207 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,218 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,218 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,218 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,226 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,226 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,226 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,332 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:55,333 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,333 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:55,397 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 563 states. [2024-05-30 16:30:55,397 INFO L212 cStratifiedReduction]: Copied states 80 times. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:30:55,398 INFO L78 Accepts]: Start accepts. Automaton has currently 576 states, but on-demand construction may add more states Word has length 255 [2024-05-30 16:30:55,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:55,411 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 16:30:55,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:55,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:55,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash 371210309, now seen corresponding path program 3 times [2024-05-30 16:30:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660764767] [2024-05-30 16:30:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 16:30:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660764767] [2024-05-30 16:30:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660764767] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845022813] [2024-05-30 16:30:57,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:30:57,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:57,186 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 16:30:57,187 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 16:30:57,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-30 16:30:57,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:30:57,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 16:30:57,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-05-30 16:30:57,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:57,938 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 16:30:57,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-30 16:30:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-30 16:30:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845022813] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:58,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 6, 9] total 40 [2024-05-30 16:30:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808461463] [2024-05-30 16:30:58,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:58,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-05-30 16:30:58,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:58,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-05-30 16:30:58,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2024-05-30 16:30:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:58,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:58,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 13.7) internal successors, (548), 40 states have internal predecessors, (548), 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 16:30:58,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:58,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:30:58,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:58,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:30:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:30:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:30:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:30:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:30:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:58,478 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:59,856 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,857 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:59,857 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,863 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,864 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,864 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,875 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,891 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,891 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,891 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,935 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,935 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:59,935 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,949 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,949 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,949 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,962 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,963 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,963 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,975 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,975 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,975 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,989 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:59,989 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:30:59,989 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,019 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,019 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,019 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,025 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,025 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,025 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,032 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,032 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,032 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,043 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,044 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,044 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,053 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,054 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,054 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,062 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,062 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,062 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,068 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,068 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,068 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,103 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:00,103 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,103 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:00,151 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 588 states. [2024-05-30 16:31:00,151 INFO L212 cStratifiedReduction]: Copied states 80 times. [2024-05-30 16:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:00,152 INFO L78 Accepts]: Start accepts. Automaton has currently 601 states, but on-demand construction may add more states Word has length 268 [2024-05-30 16:31:00,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:31:00,159 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 16:31:00,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-30 16:31:00,360 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:31:00,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:31:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -352100510, now seen corresponding path program 4 times [2024-05-30 16:31:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:31:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403705827] [2024-05-30 16:31:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:31:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:31:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 15 proven. 181 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 16:31:01,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403705827] [2024-05-30 16:31:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403705827] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209894706] [2024-05-30 16:31:01,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:31:01,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:01,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:01,956 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 16:31:01,983 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 16:31:02,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:31:02,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:31:02,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-30 16:31:02,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:31:03,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2024-05-30 16:31:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 16:31:03,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:31:03,841 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:31:03,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:31:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 1 proven. 195 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 16:31:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209894706] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:31:05,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:31:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28, 28] total 84 [2024-05-30 16:31:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119470637] [2024-05-30 16:31:05,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:31:05,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2024-05-30 16:31:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:31:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2024-05-30 16:31:05,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=6035, Unknown=0, NotChecked=0, Total=6972 [2024-05-30 16:31:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:05,567 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:31:05,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 7.833333333333333) internal successors, (658), 84 states have internal predecessors, (658), 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 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:05,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:05,569 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:07,936 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:07,936 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:07,936 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,942 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:07,942 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,942 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,961 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:07,961 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,961 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,979 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:07,979 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,979 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,992 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:07,992 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:07,993 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,009 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,009 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,009 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,038 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,038 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,038 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,044 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,044 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,044 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,052 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,052 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,052 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,079 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,079 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,079 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,087 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,087 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,087 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,093 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,093 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,094 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,100 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,100 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,100 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,134 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:08,134 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,134 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:08,191 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 646 states. [2024-05-30 16:31:08,191 INFO L212 cStratifiedReduction]: Copied states 60 times. [2024-05-30 16:31:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:08,192 INFO L78 Accepts]: Start accepts. Automaton has currently 677 states, but on-demand construction may add more states Word has length 301 [2024-05-30 16:31:08,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:31:08,201 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 16:31:08,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:08,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:31:08,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:31:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1679817687, now seen corresponding path program 5 times [2024-05-30 16:31:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:31:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464441328] [2024-05-30 16:31:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:31:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:31:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 46 proven. 140 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-05-30 16:31:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464441328] [2024-05-30 16:31:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464441328] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983213070] [2024-05-30 16:31:08,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:31:08,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:08,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:08,800 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 16:31:08,802 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 16:31:09,002 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-05-30 16:31:09,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:31:09,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 27 conjunts are in the unsatisfiable core [2024-05-30 16:31:09,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:31:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 210 proven. 175 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-05-30 16:31:09,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:31:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 105 proven. 280 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-05-30 16:31:10,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983213070] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:31:10,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:31:10,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 27] total 64 [2024-05-30 16:31:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191184868] [2024-05-30 16:31:10,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:31:10,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-30 16:31:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:31:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-30 16:31:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=3492, Unknown=0, NotChecked=0, Total=4032 [2024-05-30 16:31:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:10,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:31:10,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 9.140625) internal successors, (585), 64 states have internal predecessors, (585), 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 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:10,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:10,547 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:12,263 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,263 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:12,263 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,270 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,270 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,270 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,280 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,280 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,280 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,293 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,293 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,293 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,307 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,307 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,307 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,319 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,319 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,319 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,345 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,345 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,345 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,350 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,350 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,351 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,357 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,357 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,357 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,371 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,371 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,371 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,380 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,380 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,381 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,388 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,388 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,388 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,396 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,396 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,396 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,437 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:12,437 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,437 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:12,485 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 670 states. [2024-05-30 16:31:12,486 INFO L212 cStratifiedReduction]: Copied states 60 times. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:12,487 INFO L78 Accepts]: Start accepts. Automaton has currently 701 states, but on-demand construction may add more states Word has length 317 [2024-05-30 16:31:12,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:31:12,505 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 16:31:12,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:12,694 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:31:12,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:31:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1456494992, now seen corresponding path program 6 times [2024-05-30 16:31:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:31:12,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664288004] [2024-05-30 16:31:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:31:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:31:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 163 proven. 286 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-05-30 16:31:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664288004] [2024-05-30 16:31:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664288004] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498240036] [2024-05-30 16:31:13,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:31:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:13,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:13,485 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 16:31:13,486 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 16:31:14,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-05-30 16:31:14,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:31:14,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-30 16:31:14,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:31:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 117 proven. 334 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:15,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:31:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 181 proven. 270 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498240036] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:31:17,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:31:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 38, 33] total 97 [2024-05-30 16:31:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063316180] [2024-05-30 16:31:17,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:31:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-05-30 16:31:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:31:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-05-30 16:31:17,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1651, Invalid=7661, Unknown=0, NotChecked=0, Total=9312 [2024-05-30 16:31:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:17,058 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:31:17,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 7.979381443298969) internal successors, (774), 97 states have internal predecessors, (774), 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 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:17,059 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:18,444 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,444 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:18,444 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,450 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,450 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,450 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,460 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,460 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,460 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,471 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,471 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,471 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,483 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,494 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,494 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,494 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,520 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,520 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,526 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,526 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,526 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,532 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,532 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,532 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,543 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,550 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,550 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,550 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,557 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,557 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,557 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,563 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,563 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,563 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,595 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:18,595 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,595 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:18,630 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 682 states. [2024-05-30 16:31:18,630 INFO L212 cStratifiedReduction]: Copied states 60 times. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:31:18,631 INFO L78 Accepts]: Start accepts. Automaton has currently 713 states, but on-demand construction may add more states Word has length 333 [2024-05-30 16:31:18,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:31:18,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-05-30 16:31:18,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-30 16:31:18,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:31:18,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:31:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash -292145714, now seen corresponding path program 7 times [2024-05-30 16:31:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:31:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035233602] [2024-05-30 16:31:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:31:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:31:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 108 proven. 481 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:21,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:21,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035233602] [2024-05-30 16:31:21,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035233602] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:21,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859247563] [2024-05-30 16:31:21,256 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:31:21,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:21,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:21,257 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 16:31:21,259 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 16:31:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:21,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 67 conjunts are in the unsatisfiable core [2024-05-30 16:31:21,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:31:23,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-05-30 16:31:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 5 proven. 584 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:23,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:31:24,518 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:31:24,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:31:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 10 proven. 579 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859247563] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:31:27,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:31:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 41, 41] total 123 [2024-05-30 16:31:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773482186] [2024-05-30 16:31:27,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:31:27,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2024-05-30 16:31:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:31:27,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2024-05-30 16:31:27,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2127, Invalid=12879, Unknown=0, NotChecked=0, Total=15006 [2024-05-30 16:31:27,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:27,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:31:27,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 6.739837398373984) internal successors, (829), 123 states have internal predecessors, (829), 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 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:31:27,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:27,306 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:30,533 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,533 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:30,533 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,539 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,539 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,540 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,549 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,549 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,549 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,560 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,561 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,561 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,573 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,573 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,573 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,583 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,583 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,583 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,608 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,608 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,608 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,613 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,614 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,614 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,619 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,620 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,620 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,642 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,642 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,642 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,649 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,649 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,650 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,656 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,656 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,656 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,662 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,662 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,662 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,805 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:30,805 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,805 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:30,859 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 713 states. [2024-05-30 16:31:30,859 INFO L212 cStratifiedReduction]: Copied states 60 times. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:31:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:31:30,860 INFO L78 Accepts]: Start accepts. Automaton has currently 744 states, but on-demand construction may add more states Word has length 346 [2024-05-30 16:31:30,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:31:30,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-30 16:31:31,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:31,068 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:31:31,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:31:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1928659451, now seen corresponding path program 8 times [2024-05-30 16:31:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:31:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729978104] [2024-05-30 16:31:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:31:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:31:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 142 proven. 574 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729978104] [2024-05-30 16:31:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729978104] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569140784] [2024-05-30 16:31:33,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:31:33,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:33,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:33,413 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 16:31:33,415 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 16:31:33,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:31:33,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:31:33,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 76 conjunts are in the unsatisfiable core [2024-05-30 16:31:33,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:31:35,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2024-05-30 16:31:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 1 proven. 715 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:36,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:31:36,772 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:31:36,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:31:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 10 proven. 706 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569140784] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:31:39,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:31:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 44, 44] total 132 [2024-05-30 16:31:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332829122] [2024-05-30 16:31:39,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:31:39,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2024-05-30 16:31:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:31:39,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2024-05-30 16:31:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2458, Invalid=14834, Unknown=0, NotChecked=0, Total=17292 [2024-05-30 16:31:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:39,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:31:39,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 6.575757575757576) internal successors, (868), 132 states have internal predecessors, (868), 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 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:39,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:39,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:39,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:31:39,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:31:39,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:39,129 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:42,819 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,819 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:42,819 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,825 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,825 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,825 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,835 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,835 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,845 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,845 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,846 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,857 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,857 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,857 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,868 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,868 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,868 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,892 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,892 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,892 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,897 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,897 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,897 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,903 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,903 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,903 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,930 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,930 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,930 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,939 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,939 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,939 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,949 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,950 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,950 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,959 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,959 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,960 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,992 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:42,993 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:42,993 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:43,063 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 738 states. [2024-05-30 16:31:43,063 INFO L212 cStratifiedReduction]: Copied states 60 times. [2024-05-30 16:31:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:31:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:31:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:31:43,065 INFO L78 Accepts]: Start accepts. Automaton has currently 769 states, but on-demand construction may add more states Word has length 359 [2024-05-30 16:31:43,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:31:43,082 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 16:31:43,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-30 16:31:43,273 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:31:43,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:31:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash 512671596, now seen corresponding path program 9 times [2024-05-30 16:31:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:31:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187642333] [2024-05-30 16:31:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:31:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:31:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 181 proven. 675 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:31:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:45,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187642333] [2024-05-30 16:31:45,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187642333] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:45,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542100172] [2024-05-30 16:31:45,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:31:45,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:45,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:45,883 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 16:31:45,885 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 16:31:46,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-05-30 16:31:46,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:31:46,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 46 conjunts are in the unsatisfiable core [2024-05-30 16:31:46,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:31:48,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:31:48,552 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 34 treesize of output 29 [2024-05-30 16:31:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-05-30 16:31:48,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:31:49,626 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-05-30 16:31:49,627 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 45 treesize of output 101 [2024-05-30 16:31:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 2 proven. 310 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-05-30 16:31:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542100172] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:31:52,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:31:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 28, 23] total 96 [2024-05-30 16:31:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673860039] [2024-05-30 16:31:52,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:31:52,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-05-30 16:31:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:31:52,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-05-30 16:31:52,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=8306, Unknown=0, NotChecked=0, Total=9120 [2024-05-30 16:31:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:52,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:31:52,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 7.5625) internal successors, (726), 96 states have internal predecessors, (726), 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 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:31:52,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:52,181 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:56,445 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:56,445 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:56,445 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,451 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:56,451 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,451 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,461 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:56,461 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,461 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,472 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:56,472 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,472 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,508 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:56,509 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:56,509 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,516 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:56,516 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,516 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:31:56,618 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 703 states. [2024-05-30 16:31:56,618 INFO L212 cStratifiedReduction]: Copied states 21 times. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:31:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:31:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:31:56,620 INFO L78 Accepts]: Start accepts. Automaton has currently 742 states, but on-demand construction may add more states Word has length 385 [2024-05-30 16:31:56,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:31:56,631 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 16:31:56,830 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 16:31:56,830 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:31:56,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:31:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash 766212269, now seen corresponding path program 10 times [2024-05-30 16:31:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:31:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917386410] [2024-05-30 16:31:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:31:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:31:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 237 proven. 792 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 16:31:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917386410] [2024-05-30 16:31:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917386410] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139956200] [2024-05-30 16:31:59,714 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:31:59,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:59,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:59,715 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 16:31:59,717 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 16:31:59,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:31:59,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:31:59,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 97 conjunts are in the unsatisfiable core [2024-05-30 16:31:59,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:32:02,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2024-05-30 16:32:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 1 proven. 1028 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 16:32:03,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:32:04,116 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:32:04,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:32:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 10 proven. 1019 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 16:32:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139956200] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:32:07,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:32:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 51, 51] total 153 [2024-05-30 16:32:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487684235] [2024-05-30 16:32:07,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:32:07,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 153 states [2024-05-30 16:32:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:32:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2024-05-30 16:32:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3202, Invalid=20054, Unknown=0, NotChecked=0, Total=23256 [2024-05-30 16:32:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:07,488 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:32:07,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 153 states, 153 states have (on average 6.281045751633987) internal successors, (961), 153 states have internal predecessors, (961), 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 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:07,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:07,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:07,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:07,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:07,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:07,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:07,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:07,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:07,489 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:32:13,653 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:13,653 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:32:13,653 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,659 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:13,659 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,659 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,669 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:13,669 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,669 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,680 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:13,680 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,680 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,707 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:13,707 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:32:13,707 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,714 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:13,714 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,714 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:13,806 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 728 states. [2024-05-30 16:32:13,806 INFO L212 cStratifiedReduction]: Copied states 21 times. [2024-05-30 16:32:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:32:13,814 INFO L78 Accepts]: Start accepts. Automaton has currently 767 states, but on-demand construction may add more states Word has length 398 [2024-05-30 16:32:13,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:32:13,837 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 16:32:14,023 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 16:32:14,023 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:32:14,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:32:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1554039354, now seen corresponding path program 11 times [2024-05-30 16:32:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:32:14,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142905163] [2024-05-30 16:32:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:32:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:32:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:32:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 286 proven. 909 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 16:32:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:32:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142905163] [2024-05-30 16:32:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142905163] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:32:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556272353] [2024-05-30 16:32:17,250 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:32:17,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:32:17,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:32:17,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:32:17,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-30 16:32:17,869 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-05-30 16:32:17,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:32:17,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 97 conjunts are in the unsatisfiable core [2024-05-30 16:32:17,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:32:20,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2024-05-30 16:32:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 0 proven. 1193 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-30 16:32:20,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:32:20,837 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:32:20,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:32:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 0 proven. 439 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2024-05-30 16:32:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556272353] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:32:21,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:32:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 47, 13] total 109 [2024-05-30 16:32:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294643305] [2024-05-30 16:32:21,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:32:21,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2024-05-30 16:32:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:32:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2024-05-30 16:32:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=11223, Unknown=0, NotChecked=0, Total=11772 [2024-05-30 16:32:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:21,137 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:32:21,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 6.853211009174312) internal successors, (747), 109 states have internal predecessors, (747), 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 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:21,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:21,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:21,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:32:21,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:21,138 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:32:28,250 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,250 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:32:28,250 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,256 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,256 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,256 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,268 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,268 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,268 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,278 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,278 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,278 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,295 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,295 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,295 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,308 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,308 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,308 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,333 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,333 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,333 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,338 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,338 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,338 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,344 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,344 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,344 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,408 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,408 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,408 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,415 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,415 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,415 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,421 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,421 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,427 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,427 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,427 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,471 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:28,471 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,471 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q1_back~0, ~q1_front~0, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, thread2Thread1of1ForFork0_~j~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:32:28,572 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 958 states. [2024-05-30 16:32:28,572 INFO L212 cStratifiedReduction]: Copied states 60 times. [2024-05-30 16:32:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:32:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:32:28,574 INFO L78 Accepts]: Start accepts. Automaton has currently 1001 states, but on-demand construction may add more states Word has length 495 [2024-05-30 16:32:28,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:32:28,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-30 16:32:28,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-30 16:32:28,785 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:32:28,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:32:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 332888767, now seen corresponding path program 12 times [2024-05-30 16:32:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:32:28,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883836407] [2024-05-30 16:32:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:32:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:32:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:32:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 616 proven. 958 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-05-30 16:32:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:32:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883836407] [2024-05-30 16:32:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883836407] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:32:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188077794] [2024-05-30 16:32:30,364 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:32:30,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:32:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:32:30,365 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:32:30,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-30 16:32:37,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2024-05-30 16:32:37,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:32:37,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 57 conjunts are in the unsatisfiable core [2024-05-30 16:32:37,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:32:39,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:32:39,534 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 34 treesize of output 30 [2024-05-30 16:32:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2024-05-30 16:32:39,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:32:40,163 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-05-30 16:32:40,163 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 45 treesize of output 101 [2024-05-30 16:32:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2024-05-30 16:32:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188077794] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:32:40,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:32:40,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19, 8] total 73 [2024-05-30 16:32:40,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597005708] [2024-05-30 16:32:40,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:32:40,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-05-30 16:32:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:32:40,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-05-30 16:32:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=4721, Unknown=0, NotChecked=0, Total=5256 [2024-05-30 16:32:40,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:40,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:32:40,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 10.986301369863014) internal successors, (802), 73 states have internal predecessors, (802), 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 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:32:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:40,961 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:32:44,363 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,363 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:32:44,363 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,369 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,369 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,369 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,380 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,380 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,380 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,392 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,392 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,392 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,408 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,408 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,408 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,421 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,422 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,460 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,460 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,460 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,465 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,465 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,465 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,471 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,471 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,471 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,483 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,489 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,489 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,489 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,495 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,495 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,495 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,501 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:44,501 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,501 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:44,563 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1009 states. [2024-05-30 16:32:44,564 INFO L212 cStratifiedReduction]: Copied states 65 times. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:32:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:32:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:32:44,565 INFO L78 Accepts]: Start accepts. Automaton has currently 1061 states, but on-demand construction may add more states Word has length 517 [2024-05-30 16:32:44,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:32:44,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-05-30 16:32:44,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:32:44,776 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:32:44,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:32:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 416278234, now seen corresponding path program 1 times [2024-05-30 16:32:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:32:44,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556947464] [2024-05-30 16:32:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:32:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:32:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:32:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 729 proven. 1086 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-05-30 16:32:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:32:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556947464] [2024-05-30 16:32:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556947464] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:32:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660166210] [2024-05-30 16:32:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:32:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:32:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:32:46,569 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:32:46,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-05-30 16:32:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:32:46,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-30 16:32:46,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:32:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 841 proven. 976 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:32:49,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:32:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 700 proven. 1117 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:32:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660166210] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:32:51,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:32:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2024-05-30 16:32:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447097738] [2024-05-30 16:32:51,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:32:51,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 154 states [2024-05-30 16:32:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:32:51,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2024-05-30 16:32:51,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3407, Invalid=20155, Unknown=0, NotChecked=0, Total=23562 [2024-05-30 16:32:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:51,609 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:32:51,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 154 states, 154 states have (on average 6.214285714285714) internal successors, (957), 154 states have internal predecessors, (957), 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 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:32:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:51,610 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:32:54,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,029 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:32:54,029 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,035 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,035 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,035 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,046 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,046 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,046 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,057 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,058 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,058 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,070 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,071 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,071 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,082 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,082 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,082 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,107 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,107 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,107 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,112 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,112 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,112 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,118 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,118 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,118 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,130 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,130 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,136 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,136 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,136 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,217 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,218 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,218 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,223 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:32:54,223 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,223 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:32:54,280 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1018 states. [2024-05-30 16:32:54,281 INFO L212 cStratifiedReduction]: Copied states 65 times. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:32:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:32:54,282 INFO L78 Accepts]: Start accepts. Automaton has currently 1070 states, but on-demand construction may add more states Word has length 525 [2024-05-30 16:32:54,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:32:54,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-05-30 16:32:54,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:32:54,504 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:32:54,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:32:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1443039479, now seen corresponding path program 2 times [2024-05-30 16:32:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:32:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911939395] [2024-05-30 16:32:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:32:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:32:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:32:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 808 proven. 1138 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:32:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:32:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911939395] [2024-05-30 16:32:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911939395] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:32:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086924364] [2024-05-30 16:32:56,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:32:56,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:32:56,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:32:56,646 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:32:56,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-05-30 16:32:56,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:32:56,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:32:56,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 57 conjunts are in the unsatisfiable core [2024-05-30 16:32:56,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:32:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 841 proven. 1105 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:32:59,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:33:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 744 proven. 1202 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:33:02,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086924364] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:33:02,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:33:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 163 [2024-05-30 16:33:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063512926] [2024-05-30 16:33:02,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:33:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 163 states [2024-05-30 16:33:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:33:02,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2024-05-30 16:33:02,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3805, Invalid=22601, Unknown=0, NotChecked=0, Total=26406 [2024-05-30 16:33:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:33:02,051 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:33:02,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 163 states, 163 states have (on average 6.061349693251533) internal successors, (988), 163 states have internal predecessors, (988), 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 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:33:02,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:33:02,053 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:33:04,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,129 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:33:04,129 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,136 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,136 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,136 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,166 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,166 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,167 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,194 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,194 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,194 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,227 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,228 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,228 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,254 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,254 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,255 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,292 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,292 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,292 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,436 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,436 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,436 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,442 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,442 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,442 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,469 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,469 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,469 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,475 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,492 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,492 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,501 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,501 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,501 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,508 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:33:04,509 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,509 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~n1~0, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1] [2024-05-30 16:33:04,572 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1027 states. [2024-05-30 16:33:04,572 INFO L212 cStratifiedReduction]: Copied states 65 times. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:33:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:33:04,574 INFO L78 Accepts]: Start accepts. Automaton has currently 1079 states, but on-demand construction may add more states Word has length 533 [2024-05-30 16:33:04,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:33:04,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-05-30 16:33:04,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-05-30 16:33:04,786 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:33:04,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:33:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1034577976, now seen corresponding path program 3 times [2024-05-30 16:33:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:33:04,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311426846] [2024-05-30 16:33:04,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:33:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:33:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:33:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 600 proven. 1483 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:33:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:33:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311426846] [2024-05-30 16:33:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311426846] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:33:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111506855] [2024-05-30 16:33:10,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:33:10,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:33:10,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:33:10,001 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:33:10,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-05-30 16:33:50,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-05-30 16:33:50,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:33:50,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 89 conjunts are in the unsatisfiable core [2024-05-30 16:33:50,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:34:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 24 proven. 1342 refuted. 27 times theorem prover too weak. 1327 trivial. 0 not checked. [2024-05-30 16:34:09,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:34:10,492 INFO L349 Elim1Store]: treesize reduction 12, result has 87.6 percent of original size [2024-05-30 16:34:10,493 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 61 treesize of output 101 [2024-05-30 16:34:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 6 proven. 701 refuted. 0 times theorem prover too weak. 2013 trivial. 0 not checked. [2024-05-30 16:34:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111506855] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:34:11,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:34:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 43, 13] total 121 [2024-05-30 16:34:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176218838] [2024-05-30 16:34:11,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:34:11,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2024-05-30 16:34:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:34:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2024-05-30 16:34:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=13646, Unknown=19, NotChecked=0, Total=14520 [2024-05-30 16:34:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:34:11,359 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:34:11,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 6.710743801652892) internal successors, (812), 121 states have internal predecessors, (812), 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 16:34:11,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:34:11,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:34:11,360 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:34:22,998 WARN L539 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] [2024-05-30 16:34:25,005 WARN L539 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] [2024-05-30 16:34:29,469 WARN L539 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] [2024-05-30 16:34:31,851 WARN L539 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] [2024-05-30 16:34:34,264 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] [2024-05-30 16:34:38,364 WARN L539 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] [2024-05-30 16:34:40,383 WARN L539 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] [2024-05-30 16:34:42,394 WARN L539 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] [2024-05-30 16:34:44,402 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] [2024-05-30 16:34:48,442 WARN L539 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] [2024-05-30 16:34:50,452 WARN L539 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] [2024-05-30 16:34:52,459 WARN L539 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] [2024-05-30 16:34:54,461 WARN L539 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] [2024-05-30 16:35:09,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-30 16:35:11,895 WARN L539 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] [2024-05-30 16:35:13,914 WARN L539 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] [2024-05-30 16:35:15,927 WARN L539 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] [2024-05-30 16:35:17,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 [0] [2024-05-30 16:35:20,248 WARN L539 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] [2024-05-30 16:35:22,254 WARN L539 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] [2024-05-30 16:35:47,138 WARN L539 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] [2024-05-30 16:35:49,152 WARN L539 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] [2024-05-30 16:36:09,448 WARN L539 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 16:36:13,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-30 16:36:15,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-30 16:36:17,582 WARN L539 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] [2024-05-30 16:36:19,594 WARN L539 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] [2024-05-30 16:36:19,642 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:36:19,642 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:36:19,642 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:19,648 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:36:19,648 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:19,648 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:21,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-30 16:36:21,666 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:36:21,666 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:21,666 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:23,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-30 16:36:23,689 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:36:23,689 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:23,689 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:40,389 WARN L539 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] [2024-05-30 16:36:42,432 WARN L539 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] [2024-05-30 16:36:46,509 WARN L539 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] [2024-05-30 16:36:46,638 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:36:46,639 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:46,639 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:48,650 WARN L539 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] [2024-05-30 16:36:48,666 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:36:48,666 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:48,666 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:36:50,715 WARN L539 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] [2024-05-30 16:36:52,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 16:36:54,766 WARN L539 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 16:36:56,790 WARN L539 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 16:36:58,808 WARN L539 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 16:37:00,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 16:37:02,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 16:37:04,902 WARN L539 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] [2024-05-30 16:37:06,924 WARN L539 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] [2024-05-30 16:37:17,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 [0] [2024-05-30 16:37:19,042 WARN L539 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] [2024-05-30 16:37:21,069 WARN L539 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] [2024-05-30 16:37:23,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-30 16:37:25,080 WARN L539 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] [2024-05-30 16:37:27,087 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] [2024-05-30 16:37:29,091 WARN L539 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] [2024-05-30 16:37:31,098 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] [2024-05-30 16:37:33,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 [0] [2024-05-30 16:37:35,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 [0] [2024-05-30 16:37:45,194 WARN L539 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] [2024-05-30 16:37:47,223 WARN L539 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 16:37:49,233 WARN L539 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 16:37:51,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 16:37:53,274 WARN L539 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 16:37:55,303 WARN L539 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 16:37:57,314 WARN L539 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 16:37:57,358 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:37:57,359 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:37:57,359 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:37:57,366 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:37:57,367 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:37:57,367 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:37:57,376 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:37:57,376 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:37:57,376 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:37:59,389 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] [2024-05-30 16:38:01,412 WARN L539 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] [2024-05-30 16:38:03,424 WARN L539 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] [2024-05-30 16:38:05,434 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] [2024-05-30 16:38:05,450 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:05,451 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,451 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,461 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:05,461 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,461 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,471 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:05,471 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,471 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,479 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:05,479 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,479 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:05,692 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1156 states. [2024-05-30 16:38:05,692 INFO L212 cStratifiedReduction]: Copied states 63 times. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:38:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:38:05,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2024-05-30 16:38:05,694 INFO L78 Accepts]: Start accepts. Automaton has currently 1311 states, but on-demand construction may add more states Word has length 555 [2024-05-30 16:38:05,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:38:05,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-05-30 16:38:05,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:38:05,910 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:38:05,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:38:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 824668499, now seen corresponding path program 4 times [2024-05-30 16:38:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:38:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096102115] [2024-05-30 16:38:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:38:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:38:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:38:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2999 backedges. 710 proven. 1652 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:38:11,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:38:11,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096102115] [2024-05-30 16:38:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096102115] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:38:11,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121163089] [2024-05-30 16:38:11,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:38:11,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:38:11,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:38:11,579 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:38:11,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-05-30 16:38:11,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:38:11,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:38:11,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 144 conjunts are in the unsatisfiable core [2024-05-30 16:38:11,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:38:18,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2024-05-30 16:38:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2999 backedges. 9 proven. 2353 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:38:18,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:38:21,109 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:38:21,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:38:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2999 backedges. 9 proven. 2353 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:38:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121163089] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:38:29,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:38:29,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 73, 73] total 219 [2024-05-30 16:38:29,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158252835] [2024-05-30 16:38:29,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:38:29,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 219 states [2024-05-30 16:38:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:38:29,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2024-05-30 16:38:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6591, Invalid=41151, Unknown=0, NotChecked=0, Total=47742 [2024-05-30 16:38:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:38:29,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:38:29,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 219 states, 219 states have (on average 5.840182648401827) internal successors, (1279), 219 states have internal predecessors, (1279), 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 16:38:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:38:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:38:29,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:38:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2024-05-30 16:38:29,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:38:29,136 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:38:42,429 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,429 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:38:42,429 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,434 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,434 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,434 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,449 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,450 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,450 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,466 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,467 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,467 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,484 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,484 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,484 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,499 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,500 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,500 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,522 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,522 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,522 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,545 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,545 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,545 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,553 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,553 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,553 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,562 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,562 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,562 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,599 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,599 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,599 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,609 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,609 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,609 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,617 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,618 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,618 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,628 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:38:42,628 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,628 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:38:42,775 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1188 states. [2024-05-30 16:38:42,776 INFO L212 cStratifiedReduction]: Copied states 70 times. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:38:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:38:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:38:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2024-05-30 16:38:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-05-30 16:38:42,777 INFO L78 Accepts]: Start accepts. Automaton has currently 1336 states, but on-demand construction may add more states Word has length 568 [2024-05-30 16:38:42,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:38:42,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-05-30 16:38:42,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-05-30 16:38:42,989 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:38:42,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:38:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -47405012, now seen corresponding path program 5 times [2024-05-30 16:38:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:38:42,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700635697] [2024-05-30 16:38:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:38:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:38:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:38:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 789 proven. 1817 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-05-30 16:38:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:38:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700635697] [2024-05-30 16:38:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700635697] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:38:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911556579] [2024-05-30 16:38:48,968 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:38:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:38:48,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:38:48,973 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:38:48,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-05-30 16:39:42,250 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-05-30 16:39:42,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:39:42,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 135 conjunts are in the unsatisfiable core [2024-05-30 16:39:42,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:39:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 8 proven. 2585 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-05-30 16:39:47,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:39:48,021 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:39:48,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:39:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 4 proven. 1052 refuted. 0 times theorem prover too weak. 2187 trivial. 0 not checked. [2024-05-30 16:39:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911556579] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:39:48,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:39:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 66, 20] total 153 [2024-05-30 16:39:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683248859] [2024-05-30 16:39:48,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:39:48,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 153 states [2024-05-30 16:39:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:39:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2024-05-30 16:39:48,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=22216, Unknown=0, NotChecked=0, Total=23256 [2024-05-30 16:39:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:39:48,404 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:39:48,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 153 states, 153 states have (on average 6.477124183006536) internal successors, (991), 153 states have internal predecessors, (991), 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 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-05-30 16:39:48,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:39:48,406 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:40:04,696 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,697 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:40:04,697 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,731 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,731 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,731 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,746 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,746 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,746 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,767 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,768 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,768 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,784 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,785 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,785 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,800 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,800 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,800 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,820 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,820 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,820 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,842 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,842 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,842 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,849 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,849 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,849 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,858 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,858 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,858 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,904 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,904 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,904 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,914 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,914 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,914 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,923 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,923 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,923 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,931 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:40:04,931 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:04,932 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ~q2_back~0, ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset, 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, ~q1~0.base, ~q2_front~0, ~q1_back~0, ~q1_front~0, ~t~0, ~q2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post29#1, #memory_int, ~q2~0.base, thread2Thread1of1ForFork0_~j~0#1, thread3Thread1of1ForFork1_~k~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:40:05,104 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1353 states. [2024-05-30 16:40:05,104 INFO L212 cStratifiedReduction]: Copied states 70 times. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-05-30 16:40:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-05-30 16:40:05,105 INFO L78 Accepts]: Start accepts. Automaton has currently 1513 states, but on-demand construction may add more states Word has length 656 [2024-05-30 16:40:05,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:40:05,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-05-30 16:40:05,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:40:05,325 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:40:05,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:40:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1469788883, now seen corresponding path program 6 times [2024-05-30 16:40:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:40:05,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814509261] [2024-05-30 16:40:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:40:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:40:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:40:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4689 backedges. 1372 proven. 2054 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2024-05-30 16:40:08,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:40:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814509261] [2024-05-30 16:40:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814509261] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:40:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778985086] [2024-05-30 16:40:08,726 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:40:08,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:40:08,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:40:08,727 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:40:08,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process Received shutdown request... [2024-05-30 16:44:44,827 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:44:44,834 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:44:44,834 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:44:45,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 16:44:45,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2024-05-30 16:44:46,039 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forcibly destroying the process [2024-05-30 16:44:46,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-30 16:44:46,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-05-30 16:44:46,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2024-05-30 16:44:46,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082525929] [2024-05-30 16:44:46,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-05-30 16:44:46,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-05-30 16:44:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:44:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-05-30 16:44:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=788, Invalid=3904, Unknown=0, NotChecked=0, Total=4692 [2024-05-30 16:44:46,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:44:46,058 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:44:46,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 7.3768115942028984) internal successors, (509), 69 states have internal predecessors, (509), 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 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:44:46,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-05-30 16:44:46,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:44:46,059 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:44:46,059 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1 states. [2024-05-30 16:44:46,059 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:44:46,060 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forcibly destroying the process [2024-05-30 16:44:46,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-05-30 16:44:46,060 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2024-05-30 16:44:46,062 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:44:46,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 137 [2024-05-30 16:44:46,083 INFO L445 BasicCegarLoop]: Path program histogram: [12, 6, 3, 2, 1, 1] [2024-05-30 16:44:46,085 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-05-30 16:44:46,086 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:44:46,086 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:44:46,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:44:46 BasicIcfg [2024-05-30 16:44:46,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:44:46,088 INFO L158 Benchmark]: Toolchain (without parser) took 854633.06ms. Allocated memory was 315.6MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 241.3MB in the beginning and 880.5MB in the end (delta: -639.2MB). Peak memory consumption was 597.2MB. Max. memory is 8.0GB. [2024-05-30 16:44:46,088 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory is still 174.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:44:46,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.80ms. Allocated memory is still 315.6MB. Free memory was 241.1MB in the beginning and 277.9MB in the end (delta: -36.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2024-05-30 16:44:46,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.47ms. Allocated memory is still 315.6MB. Free memory was 277.9MB in the beginning and 275.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:44:46,089 INFO L158 Benchmark]: Boogie Preprocessor took 30.43ms. Allocated memory is still 315.6MB. Free memory was 275.3MB in the beginning and 273.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:44:46,093 INFO L158 Benchmark]: RCFGBuilder took 520.91ms. Allocated memory is still 315.6MB. Free memory was 273.2MB in the beginning and 237.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2024-05-30 16:44:46,095 INFO L158 Benchmark]: TraceAbstraction took 853841.46ms. Allocated memory was 315.6MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 236.5MB in the beginning and 880.5MB in the end (delta: -644.0MB). Peak memory consumption was 591.7MB. Max. memory is 8.0GB. [2024-05-30 16:44:46,098 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory is still 174.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.80ms. Allocated memory is still 315.6MB. Free memory was 241.1MB in the beginning and 277.9MB in the end (delta: -36.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.47ms. Allocated memory is still 315.6MB. Free memory was 277.9MB in the beginning and 275.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.43ms. Allocated memory is still 315.6MB. Free memory was 275.3MB in the beginning and 273.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.91ms. Allocated memory is still 315.6MB. Free memory was 273.2MB in the beginning and 237.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 853841.46ms. Allocated memory was 315.6MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 236.5MB in the beginning and 880.5MB in the end (delta: -644.0MB). Peak memory consumption was 591.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8014, independent: 6956, independent conditional: 6956, independent unconditional: 0, dependent: 1058, dependent conditional: 1058, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7135, independent: 6956, independent conditional: 6956, independent unconditional: 0, dependent: 179, dependent conditional: 179, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7135, independent: 6956, independent conditional: 6956, independent unconditional: 0, dependent: 179, dependent conditional: 179, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10006, independent: 6956, independent conditional: 0, independent unconditional: 6956, dependent: 3050, dependent conditional: 2871, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10006, independent: 6956, independent conditional: 0, independent unconditional: 6956, dependent: 3050, dependent conditional: 0, dependent unconditional: 3050, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10006, independent: 6956, independent conditional: 0, independent unconditional: 6956, dependent: 3050, dependent conditional: 0, dependent unconditional: 3050, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7135, independent: 6956, independent conditional: 0, independent unconditional: 6956, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7135, independent: 6956, independent conditional: 0, independent unconditional: 6956, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 179, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 179, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 485, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 485, dependent conditional: 0, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10006, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2871, dependent conditional: 0, dependent unconditional: 2871, unknown: 7135, unknown conditional: 0, unknown unconditional: 7135] , Statistics on independence cache: Total cache size (in pairs): 7135, Positive cache size: 6956, Positive conditional cache size: 0, Positive unconditional cache size: 6956, Negative cache size: 179, Negative conditional cache size: 0, Negative unconditional cache size: 179, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2871, Maximal queried relation: 24, Independence queries for same thread: 879 - StatisticsResult: Reduction benchmarks 25.9ms Time before loop, 722.7ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 37, Reduction States: 483, Duplicate States: 21, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 14.8ms Time before loop, 285.1ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 37, Reduction States: 527, Duplicate States: 21, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 6.6ms Time before loop, 50.4ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 282, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 58.1ms Time before loop, 65.5ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 290, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 10.6ms Time before loop, 70.6ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 298, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 155.7ms Time before loop, 110.0ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 307, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 293.3ms Time before loop, 139.9ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 316, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 490.6ms Time before loop, 326.2ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 337, Duplicate States: 0, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 36.4ms Time before loop, 144.3ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 346, Duplicate States: 0, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 1779.1ms Time before loop, 2207.9ms Time in loop, 4.0s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 25, Reduction States: 563, Duplicate States: 80, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 1106.6ms Time before loop, 566.4ms Time in loop, 1.7s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 25, Reduction States: 588, Duplicate States: 80, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 1599.9ms Time before loop, 1021.7ms Time in loop, 2.6s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 23, Reduction States: 646, Duplicate States: 60, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 1250.3ms Time before loop, 688.5ms Time in loop, 1.9s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 23, Reduction States: 670, Duplicate States: 60, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 1152.6ms Time before loop, 417.6ms Time in loop, 1.6s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 23, Reduction States: 682, Duplicate States: 60, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 2646.4ms Time before loop, 906.5ms Time in loop, 3.6s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 23, Reduction States: 713, Duplicate States: 60, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 3015.2ms Time before loop, 919.0ms Time in loop, 3.9s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 23, Reduction States: 738, Duplicate States: 60, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 2360.1ms Time before loop, 2076.8ms Time in loop, 4.4s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 17, Reduction States: 703, Duplicate States: 21, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 5308.8ms Time before loop, 1008.1ms Time in loop, 6.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 17, Reduction States: 728, Duplicate States: 21, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 4589.8ms Time before loop, 2844.1ms Time in loop, 7.4s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 26, Reduction States: 958, Duplicate States: 60, Protected Variables: 15 - StatisticsResult: Reduction benchmarks 2673.7ms Time before loop, 928.8ms Time in loop, 3.6s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 28, Reduction States: 1009, Duplicate States: 65, Protected Variables: 18 - StatisticsResult: Reduction benchmarks 2190.2ms Time before loop, 479.4ms Time in loop, 2.7s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 28, Reduction States: 1018, Duplicate States: 65, Protected Variables: 18 - StatisticsResult: Reduction benchmarks 1873.6ms Time before loop, 645.3ms Time in loop, 2.5s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 28, Reduction States: 1027, Duplicate States: 65, Protected Variables: 18 - StatisticsResult: Reduction benchmarks 6678.9ms Time before loop, 227653.0ms Time in loop, 234.3s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 30, Reduction States: 1156, Duplicate States: 63, Protected Variables: 20 - StatisticsResult: Reduction benchmarks 11397.7ms Time before loop, 2241.8ms Time in loop, 13.6s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 31, Reduction States: 1188, Duplicate States: 70, Protected Variables: 21 - StatisticsResult: Reduction benchmarks 9563.8ms Time before loop, 7134.2ms Time in loop, 16.7s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 34, Reduction States: 1353, Duplicate States: 70, Protected Variables: 21 - StatisticsResult: Reduction benchmarks 0.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 421, Transitions: 544, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 421, Transitions: 550, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 192, Transitions: 201, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 199, Transitions: 208, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 206, Transitions: 215, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 214, Transitions: 223, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 222, Transitions: 231, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 235, Transitions: 245, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 243, Transitions: 253, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 427, Transitions: 525, Traversal time: 4.0s - StatisticsResult: Visitor Statistics States: 440, Transitions: 538, Traversal time: 1.7s - StatisticsResult: Visitor Statistics States: 447, Transitions: 532, Traversal time: 2.6s - StatisticsResult: Visitor Statistics States: 469, Transitions: 554, Traversal time: 1.9s - StatisticsResult: Visitor Statistics States: 479, Transitions: 564, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 498, Transitions: 583, Traversal time: 3.6s - StatisticsResult: Visitor Statistics States: 511, Transitions: 596, Traversal time: 3.9s - StatisticsResult: Visitor Statistics States: 462, Transitions: 508, Traversal time: 4.4s - StatisticsResult: Visitor Statistics States: 475, Transitions: 521, Traversal time: 6.3s - StatisticsResult: Visitor Statistics States: 648, Transitions: 739, Traversal time: 7.4s - StatisticsResult: Visitor Statistics States: 677, Transitions: 773, Traversal time: 3.6s - StatisticsResult: Visitor Statistics States: 685, Transitions: 781, Traversal time: 2.7s - StatisticsResult: Visitor Statistics States: 693, Transitions: 789, Traversal time: 2.5s - StatisticsResult: Visitor Statistics States: 798, Transitions: 954, Traversal time: 234.3s - StatisticsResult: Visitor Statistics States: 818, Transitions: 976, Traversal time: 13.6s - StatisticsResult: Visitor Statistics States: 906, Transitions: 1070, Traversal time: 16.7s - StatisticsResult: Visitor Statistics States: 1, Transitions: 0, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 289, RedundantProofs: 25, ProvenStates: 1163, Times there's more than one choice: 967, Avg number of choices: 12.942390369733449 - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 231 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 853.7s, OverallIterations: 25, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 314.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1409, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 105.1s SatisfiabilityAnalysisTime, 149.7s InterpolantComputationTime, 15704 NumberOfCodeBlocks, 15459 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 22819 ConstructedInterpolants, 377 QuantifiedInterpolants, 221049 SizeOfPredicates, 564 NumberOfNonLiveVariables, 14329 ConjunctsInSsa, 1147 ConjunctsInUnsatCore, 65 InterpolantComputations, 4 PerfectInterpolantSequences, 32480/72002 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown